/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:37:52,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:37:52,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:37:52,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:37:52,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:37:52,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:37:52,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:37:52,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:37:52,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:37:52,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:37:52,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:37:52,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:37:52,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:37:52,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:37:52,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:37:52,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:37:52,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:37:52,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:37:52,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:37:52,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:37:52,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:37:52,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:37:52,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:37:52,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:37:52,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:37:52,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:37:52,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:37:52,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:37:52,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:37:52,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:37:52,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:37:52,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:37:52,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:37:52,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:37:52,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:37:52,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:37:52,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:37:52,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:37:52,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:37:52,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:37:52,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:37:52,333 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:37:52,346 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:37:52,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:37:52,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:37:52,348 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:37:52,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:37:52,348 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:37:52,348 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:37:52,349 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:37:52,349 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:37:52,349 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:37:52,349 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:37:52,349 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:37:52,349 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:37:52,350 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:37:52,350 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:37:52,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:37:52,350 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:37:52,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:37:52,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:37:52,351 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:37:52,351 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:37:52,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:37:52,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:37:52,351 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:37:52,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:37:52,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:37:52,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:37:52,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:37:52,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:37:52,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:37:52,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:37:52,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:37:52,536 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:37:52,536 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:37:52,537 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:37:52,635 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_om_G8A/tmp/7144cf86028b413a99f7a2384d54794d/FLAG194c5cf0f [2020-07-01 12:37:52,968 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:37:52,969 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:37:52,969 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:37:52,976 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_om_G8A/tmp/7144cf86028b413a99f7a2384d54794d/FLAG194c5cf0f [2020-07-01 12:37:53,383 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_om_G8A/tmp/7144cf86028b413a99f7a2384d54794d [2020-07-01 12:37:53,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:37:53,396 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:37:53,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:37:53,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:37:53,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:37:53,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3d71f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53, skipping insertion in model container [2020-07-01 12:37:53,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:37:53,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:37:53,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:37:53,684 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:37:53,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:37:53,722 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:37:53,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53 WrapperNode [2020-07-01 12:37:53,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:37:53,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:37:53,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:37:53,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:37:53,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:37:53,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:37:53,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:37:53,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:37:53,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... [2020-07-01 12:37:53,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:37:53,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:37:53,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:37:53,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:37:53,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:37:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:37:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:37:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:37:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:37:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:37:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:37:54,166 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:37:54,167 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:37:54,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:54 BoogieIcfgContainer [2020-07-01 12:37:54,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:37:54,172 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:37:54,172 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:37:54,174 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:37:54,175 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:54" (1/1) ... [2020-07-01 12:37:54,191 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 51 edges [2020-07-01 12:37:54,196 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:37:54,196 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:37:54,197 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:37:54,197 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:37:54,199 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:37:54,200 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:37:54,200 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:37:54,228 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:37:54,260 INFO L200 BlockEncoder]: SBE split 21 edges [2020-07-01 12:37:54,265 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:37:54,266 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:37:54,291 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:37:54,293 INFO L70 RemoveSinkStates]: Removed 8 edges and 4 locations by removing sink states [2020-07-01 12:37:54,295 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:37:54,295 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:37:54,295 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:37:54,296 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:37:54,296 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 62 edges [2020-07-01 12:37:54,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:54 BasicIcfg [2020-07-01 12:37:54,297 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:37:54,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:37:54,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:37:54,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:37:54,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:37:53" (1/4) ... [2020-07-01 12:37:54,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f511bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:37:54, skipping insertion in model container [2020-07-01 12:37:54,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (2/4) ... [2020-07-01 12:37:54,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f511bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:37:54, skipping insertion in model container [2020-07-01 12:37:54,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:54" (3/4) ... [2020-07-01 12:37:54,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f511bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:37:54, skipping insertion in model container [2020-07-01 12:37:54,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:54" (4/4) ... [2020-07-01 12:37:54,306 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:37:54,316 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:37:54,324 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 12:37:54,338 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 12:37:54,362 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:37:54,362 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:37:54,362 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:37:54,362 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:37:54,362 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:37:54,362 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:37:54,363 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:37:54,363 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:37:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-01 12:37:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:54,384 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:54,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:54,385 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 225676850, now seen corresponding path program 1 times [2020-07-01 12:37:54,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:54,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20727588] [2020-07-01 12:37:54,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:54,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20727588] [2020-07-01 12:37:54,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:54,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:54,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828364322] [2020-07-01 12:37:54,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:54,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:54,580 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 12:37:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:54,700 INFO L93 Difference]: Finished difference Result 62 states and 115 transitions. [2020-07-01 12:37:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:54,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:37:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:54,716 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:37:54,716 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:54,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2020-07-01 12:37:54,759 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 5 [2020-07-01 12:37:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:54,760 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2020-07-01 12:37:54,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2020-07-01 12:37:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:54,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:54,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:54,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:37:54,763 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash 225676912, now seen corresponding path program 1 times [2020-07-01 12:37:54,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:54,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056623391] [2020-07-01 12:37:54,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:54,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056623391] [2020-07-01 12:37:54,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:54,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:54,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698913090] [2020-07-01 12:37:54,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:54,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:54,819 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand 3 states. [2020-07-01 12:37:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:54,907 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2020-07-01 12:37:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:54,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:37:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:54,908 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:37:54,909 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:37:54,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:37:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:37:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:37:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 57 transitions. [2020-07-01 12:37:54,915 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 57 transitions. Word has length 5 [2020-07-01 12:37:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:54,915 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 57 transitions. [2020-07-01 12:37:54,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 57 transitions. [2020-07-01 12:37:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:54,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:54,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:54,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:37:54,916 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash 225676914, now seen corresponding path program 1 times [2020-07-01 12:37:54,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:54,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633968411] [2020-07-01 12:37:54,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:54,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633968411] [2020-07-01 12:37:54,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:54,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:54,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538161092] [2020-07-01 12:37:54,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:54,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:54,955 INFO L87 Difference]: Start difference. First operand 32 states and 57 transitions. Second operand 3 states. [2020-07-01 12:37:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,046 INFO L93 Difference]: Finished difference Result 33 states and 57 transitions. [2020-07-01 12:37:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:55,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:37:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,048 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:37:55,048 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:37:55,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:37:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:37:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:37:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-07-01 12:37:55,054 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 5 [2020-07-01 12:37:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,054 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-07-01 12:37:55,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-07-01 12:37:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:55,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:55,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:37:55,055 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 225676915, now seen corresponding path program 1 times [2020-07-01 12:37:55,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655380642] [2020-07-01 12:37:55,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655380642] [2020-07-01 12:37:55,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:55,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242497609] [2020-07-01 12:37:55,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:37:55,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:37:55,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:37:55,092 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. [2020-07-01 12:37:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,165 INFO L93 Difference]: Finished difference Result 32 states and 56 transitions. [2020-07-01 12:37:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:37:55,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:37:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,167 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:37:55,167 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:37:55,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:37:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:37:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:37:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:37:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2020-07-01 12:37:55,172 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 5 [2020-07-01 12:37:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,172 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 55 transitions. [2020-07-01 12:37:55,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:37:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-07-01 12:37:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:37:55,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:37:55,174 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1593952412, now seen corresponding path program 1 times [2020-07-01 12:37:55,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136906099] [2020-07-01 12:37:55,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136906099] [2020-07-01 12:37:55,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:55,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123731699] [2020-07-01 12:37:55,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:55,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,206 INFO L87 Difference]: Start difference. First operand 31 states and 55 transitions. Second operand 3 states. [2020-07-01 12:37:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,288 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. [2020-07-01 12:37:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:55,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:37:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,290 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:37:55,290 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:37:55,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:37:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:37:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:37:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2020-07-01 12:37:55,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 6 [2020-07-01 12:37:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,295 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2020-07-01 12:37:55,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2020-07-01 12:37:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:37:55,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:37:55,297 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1593952410, now seen corresponding path program 1 times [2020-07-01 12:37:55,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318843126] [2020-07-01 12:37:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318843126] [2020-07-01 12:37:55,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:55,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589072985] [2020-07-01 12:37:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:37:55,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:37:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:37:55,340 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 4 states. [2020-07-01 12:37:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,417 INFO L93 Difference]: Finished difference Result 31 states and 53 transitions. [2020-07-01 12:37:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:37:55,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:37:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,419 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:37:55,419 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:37:55,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:37:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:37:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:37:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:37:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2020-07-01 12:37:55,424 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 6 [2020-07-01 12:37:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,424 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. [2020-07-01 12:37:55,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:37:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2020-07-01 12:37:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:37:55,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:37:55,426 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1593952409, now seen corresponding path program 1 times [2020-07-01 12:37:55,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598911221] [2020-07-01 12:37:55,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598911221] [2020-07-01 12:37:55,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:55,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414194709] [2020-07-01 12:37:55,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:55,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,462 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. [2020-07-01 12:37:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,528 INFO L93 Difference]: Finished difference Result 30 states and 52 transitions. [2020-07-01 12:37:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:55,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:37:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,529 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:37:55,529 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:37:55,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:37:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:37:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:37:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-07-01 12:37:55,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 6 [2020-07-01 12:37:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,534 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-07-01 12:37:55,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-07-01 12:37:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:37:55,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:37:55,535 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash 17970891, now seen corresponding path program 1 times [2020-07-01 12:37:55,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471428502] [2020-07-01 12:37:55,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471428502] [2020-07-01 12:37:55,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:55,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551640480] [2020-07-01 12:37:55,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:37:55,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:37:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:37:55,583 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 4 states. [2020-07-01 12:37:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,667 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. [2020-07-01 12:37:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:37:55,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:37:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,668 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:37:55,668 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:37:55,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:37:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:37:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:37:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:37:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-07-01 12:37:55,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 10 [2020-07-01 12:37:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,672 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-07-01 12:37:55,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:37:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-07-01 12:37:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:37:55,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:37:55,673 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 17970893, now seen corresponding path program 1 times [2020-07-01 12:37:55,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899550597] [2020-07-01 12:37:55,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899550597] [2020-07-01 12:37:55,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:37:55,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050702540] [2020-07-01 12:37:55,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:37:55,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:37:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:37:55,752 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 6 states. [2020-07-01 12:37:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:55,906 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. [2020-07-01 12:37:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:37:55,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:37:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:55,908 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:37:55,908 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:37:55,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:37:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:37:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-01 12:37:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:37:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 66 transitions. [2020-07-01 12:37:55,915 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 66 transitions. Word has length 10 [2020-07-01 12:37:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:55,915 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 66 transitions. [2020-07-01 12:37:55,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:37:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 66 transitions. [2020-07-01 12:37:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:37:55,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:55,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:55,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:37:55,916 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash 557095490, now seen corresponding path program 1 times [2020-07-01 12:37:55,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:55,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998249861] [2020-07-01 12:37:55,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:55,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998249861] [2020-07-01 12:37:55,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:55,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:55,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827267930] [2020-07-01 12:37:55,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:55,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:55,956 INFO L87 Difference]: Start difference. First operand 35 states and 66 transitions. Second operand 3 states. [2020-07-01 12:37:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,011 INFO L93 Difference]: Finished difference Result 35 states and 66 transitions. [2020-07-01 12:37:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:37:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,012 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:37:56,012 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:56,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 60 transitions. [2020-07-01 12:37:56,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 60 transitions. Word has length 11 [2020-07-01 12:37:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,018 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 60 transitions. [2020-07-01 12:37:56,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 60 transitions. [2020-07-01 12:37:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:37:56,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:37:56,019 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 557095492, now seen corresponding path program 1 times [2020-07-01 12:37:56,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391165572] [2020-07-01 12:37:56,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391165572] [2020-07-01 12:37:56,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:37:56,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995632482] [2020-07-01 12:37:56,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:37:56,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:37:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:37:56,073 INFO L87 Difference]: Start difference. First operand 33 states and 60 transitions. Second operand 5 states. [2020-07-01 12:37:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,190 INFO L93 Difference]: Finished difference Result 38 states and 66 transitions. [2020-07-01 12:37:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:37:56,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:37:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,191 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:37:56,191 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:37:56,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:37:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:37:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-01 12:37:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:37:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-07-01 12:37:56,196 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 11 [2020-07-01 12:37:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,196 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-07-01 12:37:56,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:37:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-07-01 12:37:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:37:56,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,197 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:37:56,198 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1657437841, now seen corresponding path program 1 times [2020-07-01 12:37:56,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815687202] [2020-07-01 12:37:56,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815687202] [2020-07-01 12:37:56,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081425846] [2020-07-01 12:37:56,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,224 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. [2020-07-01 12:37:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,280 INFO L93 Difference]: Finished difference Result 56 states and 104 transitions. [2020-07-01 12:37:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:37:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,281 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:37:56,281 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:37:56,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:37:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-01 12:37:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:37:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2020-07-01 12:37:56,286 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 61 transitions. Word has length 15 [2020-07-01 12:37:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,286 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 61 transitions. [2020-07-01 12:37:56,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 61 transitions. [2020-07-01 12:37:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:37:56,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:37:56,288 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 85372494, now seen corresponding path program 1 times [2020-07-01 12:37:56,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130063587] [2020-07-01 12:37:56,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:37:56,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130063587] [2020-07-01 12:37:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743307782] [2020-07-01 12:37:56,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,317 INFO L87 Difference]: Start difference. First operand 35 states and 61 transitions. Second operand 3 states. [2020-07-01 12:37:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,369 INFO L93 Difference]: Finished difference Result 70 states and 125 transitions. [2020-07-01 12:37:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:37:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,370 INFO L225 Difference]: With dead ends: 70 [2020-07-01 12:37:56,371 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:37:56,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:37:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-01 12:37:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:37:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2020-07-01 12:37:56,377 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 15 [2020-07-01 12:37:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,377 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2020-07-01 12:37:56,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2020-07-01 12:37:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:37:56,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:37:56,378 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1892826957, now seen corresponding path program 1 times [2020-07-01 12:37:56,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991583825] [2020-07-01 12:37:56,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991583825] [2020-07-01 12:37:56,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219184756] [2020-07-01 12:37:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,406 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand 3 states. [2020-07-01 12:37:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,460 INFO L93 Difference]: Finished difference Result 76 states and 137 transitions. [2020-07-01 12:37:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:37:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,461 INFO L225 Difference]: With dead ends: 76 [2020-07-01 12:37:56,461 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:37:56,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:37:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-01 12:37:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:37:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 12:37:56,467 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 15 [2020-07-01 12:37:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,467 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 12:37:56,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 12:37:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:37:56,468 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,468 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:37:56,468 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash -965091645, now seen corresponding path program 1 times [2020-07-01 12:37:56,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188515243] [2020-07-01 12:37:56,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188515243] [2020-07-01 12:37:56,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863935798] [2020-07-01 12:37:56,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,497 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. [2020-07-01 12:37:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,551 INFO L93 Difference]: Finished difference Result 73 states and 116 transitions. [2020-07-01 12:37:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-01 12:37:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,552 INFO L225 Difference]: With dead ends: 73 [2020-07-01 12:37:56,552 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:37:56,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:37:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-07-01 12:37:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:37:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2020-07-01 12:37:56,557 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 18 [2020-07-01 12:37:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,558 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-07-01 12:37:56,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2020-07-01 12:37:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:37:56,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,559 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:37:56,559 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,559 INFO L82 PathProgramCache]: Analyzing trace with hash -936462494, now seen corresponding path program 1 times [2020-07-01 12:37:56,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453264468] [2020-07-01 12:37:56,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453264468] [2020-07-01 12:37:56,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307252485] [2020-07-01 12:37:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,586 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand 3 states. [2020-07-01 12:37:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,646 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-07-01 12:37:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-01 12:37:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,647 INFO L225 Difference]: With dead ends: 67 [2020-07-01 12:37:56,648 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:37:56,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:37:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-07-01 12:37:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:37:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2020-07-01 12:37:56,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 18 [2020-07-01 12:37:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,653 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2020-07-01 12:37:56,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2020-07-01 12:37:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:37:56,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,654 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:37:56,654 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash -907833343, now seen corresponding path program 1 times [2020-07-01 12:37:56,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85421629] [2020-07-01 12:37:56,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85421629] [2020-07-01 12:37:56,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:56,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835714166] [2020-07-01 12:37:56,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:56,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,681 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 3 states. [2020-07-01 12:37:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:56,736 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2020-07-01 12:37:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:56,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-01 12:37:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:56,737 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:37:56,737 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:56,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-07-01 12:37:56,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 18 [2020-07-01 12:37:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:56,741 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-01 12:37:56,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-01 12:37:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:37:56,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:56,742 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:56,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:37:56,742 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1260872612, now seen corresponding path program 1 times [2020-07-01 12:37:56,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:56,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380755063] [2020-07-01 12:37:56,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:56,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380755063] [2020-07-01 12:37:56,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:56,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 12:37:56,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672038119] [2020-07-01 12:37:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:37:56,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:37:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:37:56,862 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 9 states. [2020-07-01 12:37:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:57,090 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-01 12:37:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:37:57,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-01 12:37:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:57,091 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:37:57,091 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:57,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:37:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-07-01 12:37:57,095 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2020-07-01 12:37:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:57,095 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-01 12:37:57,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:37:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-01 12:37:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:37:57,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:57,096 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:57,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:37:57,096 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash -340838960, now seen corresponding path program 1 times [2020-07-01 12:37:57,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:57,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142529876] [2020-07-01 12:37:57,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:57,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142529876] [2020-07-01 12:37:57,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:57,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:37:57,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023826145] [2020-07-01 12:37:57,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:37:57,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:57,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:37:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:37:57,210 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 7 states. [2020-07-01 12:37:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:57,399 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2020-07-01 12:37:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:37:57,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-01 12:37:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:57,400 INFO L225 Difference]: With dead ends: 65 [2020-07-01 12:37:57,400 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:57,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:37:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-07-01 12:37:57,403 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2020-07-01 12:37:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:57,404 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-01 12:37:57,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:37:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2020-07-01 12:37:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:37:57,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:57,405 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:57,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-01 12:37:57,405 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 240024568, now seen corresponding path program 1 times [2020-07-01 12:37:57,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:57,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643493939] [2020-07-01 12:37:57,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:57,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643493939] [2020-07-01 12:37:57,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114168189] [2020-07-01 12:37:57,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:37:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:57,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 12:37:57,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:37:57,660 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_32|]} [2020-07-01 12:37:57,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:37:57,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:37:57,681 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,695 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:37:57,703 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,712 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,713 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,713 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:37:57,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:37:57,743 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,758 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,758 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:37:57,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:37:57,812 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,825 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,828 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:37:57,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:37:57,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:37:57,931 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:37:57,935 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:37:57,949 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:57,951 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:37:57,953 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:37:57,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:34 [2020-07-01 12:37:58,007 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:37:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:58,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:37:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:37:58,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590322667] [2020-07-01 12:37:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:37:58,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:37:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:37:58,062 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 15 states. [2020-07-01 12:37:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:58,875 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2020-07-01 12:37:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:37:58,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2020-07-01 12:37:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:58,877 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:37:58,877 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 12:37:58,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:37:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 12:37:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2020-07-01 12:37:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:37:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-01 12:37:58,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 20 [2020-07-01 12:37:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:58,882 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-01 12:37:58,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:37:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-01 12:37:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:37:58,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:58,883 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:59,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:37:59,084 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 240024569, now seen corresponding path program 1 times [2020-07-01 12:37:59,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:59,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227121457] [2020-07-01 12:37:59,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:59,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227121457] [2020-07-01 12:37:59,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899127263] [2020-07-01 12:37:59,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:37:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:59,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:37:59,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:37:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:59,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:37:59,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:37:59,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619711016] [2020-07-01 12:37:59,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:37:59,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:37:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:37:59,186 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2020-07-01 12:37:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:59,235 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-07-01 12:37:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:37:59,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-01 12:37:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:59,237 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:37:59,237 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:37:59,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:37:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:37:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:37:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:37:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-07-01 12:37:59,241 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2020-07-01 12:37:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:59,241 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-07-01 12:37:59,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:37:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-01 12:37:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 12:37:59,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:59,242 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:59,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:37:59,443 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:37:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1149175175, now seen corresponding path program 1 times [2020-07-01 12:37:59,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:59,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998104204] [2020-07-01 12:37:59,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:59,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998104204] [2020-07-01 12:37:59,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176386230] [2020-07-01 12:37:59,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:37:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:59,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 12:37:59,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:37:59,690 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:37:59,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:37:59,705 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:59,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:37:59,710 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:37:59,727 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:59,730 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:37:59,730 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:37:59,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:37:59,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2020-07-01 12:37:59,897 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:37:59,898 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:37:59,899 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:37:59,900 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:37:59,901 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:37:59,902 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:37:59,903 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 12:37:59,942 INFO L619 ElimStorePlain]: treesize reduction 53, result has 35.4 percent of original size [2020-07-01 12:37:59,943 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:37:59,959 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:37:59,960 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2020-07-01 12:37:59,992 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:00,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:00,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:38:00,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526921980] [2020-07-01 12:38:00,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:38:00,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:38:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:38:00,017 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 17 states. [2020-07-01 12:38:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:00,706 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-01 12:38:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:38:00,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-07-01 12:38:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:00,707 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:38:00,707 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:38:00,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2020-07-01 12:38:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:38:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-01 12:38:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:38:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2020-07-01 12:38:00,712 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2020-07-01 12:38:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:00,712 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-07-01 12:38:00,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:38:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-01 12:38:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 12:38:00,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:00,713 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:00,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 12:38:00,914 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:38:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1149175174, now seen corresponding path program 1 times [2020-07-01 12:38:00,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:00,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150973914] [2020-07-01 12:38:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:00,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150973914] [2020-07-01 12:38:00,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514642256] [2020-07-01 12:38:00,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:01,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:38:01,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:01,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:38:01,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:38:01,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735903319] [2020-07-01 12:38:01,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:38:01,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:38:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:38:01,028 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 4 states. [2020-07-01 12:38:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:01,080 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-01 12:38:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:38:01,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-01 12:38:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:01,082 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:38:01,082 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:38:01,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:38:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:38:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:38:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:38:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-01 12:38:01,086 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2020-07-01 12:38:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:01,086 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-01 12:38:01,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:38:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-01 12:38:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-01 12:38:01,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:01,087 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:01,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:01,288 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:38:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 229418951, now seen corresponding path program 2 times [2020-07-01 12:38:01,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:01,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849175978] [2020-07-01 12:38:01,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:01,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849175978] [2020-07-01 12:38:01,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593783124] [2020-07-01 12:38:01,547 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:01,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:38:01,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:01,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 12:38:01,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:01,614 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_33|]} [2020-07-01 12:38:01,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:01,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:01,619 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,632 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:38:01,637 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,644 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,645 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,645 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:38:01,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:38:01,668 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,677 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,678 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:01,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:38:01,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:38:01,710 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,719 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,720 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:01,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:38:01,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:38:01,858 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:01,858 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:38:01,873 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:01,874 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:01,875 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:01,876 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-07-01 12:38:01,915 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 12:38:01,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:01,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 12:38:01,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477034145] [2020-07-01 12:38:01,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:38:01,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:01,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:38:01,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:38:01,940 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 15 states. [2020-07-01 12:38:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:03,000 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-01 12:38:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 12:38:03,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2020-07-01 12:38:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:03,001 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:38:03,001 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:38:03,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:38:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:38:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-07-01 12:38:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:38:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-01 12:38:03,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2020-07-01 12:38:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:03,006 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-01 12:38:03,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:38:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-01 12:38:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-01 12:38:03,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:03,007 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:03,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 12:38:03,208 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:38:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1477949302, now seen corresponding path program 2 times [2020-07-01 12:38:03,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:03,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396736263] [2020-07-01 12:38:03,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:03,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396736263] [2020-07-01 12:38:03,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512401780] [2020-07-01 12:38:03,532 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:03,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:38:03,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:03,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 12:38:03,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:03,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:03,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:38:03,598 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:03,613 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:38:03,613 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:03,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:38:03,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:38:03,631 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:03,634 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:03,634 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:03,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:38:03,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:03,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 12:38:03,759 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:03,759 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:03,760 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:03,761 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:03,762 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:38:03,762 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:38:03,763 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 12:38:03,800 INFO L619 ElimStorePlain]: treesize reduction 57, result has 37.4 percent of original size [2020-07-01 12:38:03,800 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:03,801 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-07-01 12:38:03,825 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 12:38:03,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:03,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-01 12:38:03,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559119878] [2020-07-01 12:38:03,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:38:03,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:38:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:38:03,864 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 18 states. [2020-07-01 12:38:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:04,986 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-01 12:38:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-01 12:38:04,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-07-01 12:38:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:04,987 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:38:04,987 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 12:38:04,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2020-07-01 12:38:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 12:38:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-01 12:38:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:38:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-01 12:38:04,992 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 31 [2020-07-01 12:38:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:04,992 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-01 12:38:04,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:38:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-01 12:38:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-01 12:38:04,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:04,993 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:05,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:05,194 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:38:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1099987627, now seen corresponding path program 1 times [2020-07-01 12:38:05,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:05,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44522245] [2020-07-01 12:38:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 12:38:05,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44522245] [2020-07-01 12:38:05,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453700125] [2020-07-01 12:38:05,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:05,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 12:38:05,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:05,409 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_34|]} [2020-07-01 12:38:05,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:05,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:05,414 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,421 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:38:05,425 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,431 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,431 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,432 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:38:05,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:38:05,451 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,457 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,457 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 12:38:05,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 12:38:05,480 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,487 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,488 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:05,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 12:38:05,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 12:38:05,588 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:05,588 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:38:05,596 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:05,596 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:05,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 12:38:05,617 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-01 12:38:05,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:05,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 12:38:05,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29606316] [2020-07-01 12:38:05,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:38:05,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:38:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:38:05,640 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 15 states. [2020-07-01 12:38:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:05,980 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-01 12:38:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:38:05,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-07-01 12:38:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:05,981 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:38:05,981 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:38:05,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-01 12:38:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:38:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:38:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:38:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-01 12:38:05,986 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 40 [2020-07-01 12:38:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:05,986 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-01 12:38:05,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:38:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-01 12:38:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-01 12:38:05,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:05,987 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:06,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 12:38:06,188 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:38:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 260119740, now seen corresponding path program 1 times [2020-07-01 12:38:06,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:06,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004179682] [2020-07-01 12:38:06,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 12:38:06,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004179682] [2020-07-01 12:38:06,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025112792] [2020-07-01 12:38:06,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:06,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 12:38:06,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:06,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:06,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:38:06,448 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:06,468 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:38:06,469 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:06,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:38:06,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:38:06,491 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:06,499 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:06,499 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:06,500 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:38:06,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:06,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 12:38:06,611 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:38:06,612 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:06,613 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-07-01 12:38:06,613 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:06,614 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:38:06,615 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:06,616 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:06,616 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 12:38:06,663 INFO L619 ElimStorePlain]: treesize reduction 111, result has 23.4 percent of original size [2020-07-01 12:38:06,664 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:06,664 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-07-01 12:38:06,687 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-01 12:38:06,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:06,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-01 12:38:06,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751480955] [2020-07-01 12:38:06,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:38:06,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:38:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:38:06,708 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2020-07-01 12:38:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:07,097 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-01 12:38:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:38:07,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2020-07-01 12:38:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:07,098 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:38:07,098 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:38:07,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:38:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:38:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:38:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:38:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:38:07,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-01 12:38:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:07,099 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:38:07,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:38:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:38:07,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:38:07,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 12:38:07,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:38:08,170 WARN L192 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2020-07-01 12:38:08,174 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L19-4(lines 19 20) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-01 12:38:08,175 INFO L268 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point L32-2(lines 29 43) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,176 INFO L268 CegarLoopResult]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point L16-6(lines 16 23) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-07-01 12:38:08,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 12:38:08,178 INFO L264 CegarLoopResult]: At program point L16-8(lines 16 23) the Hoare annotation is: (let ((.cse16 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse25 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse8 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse22 (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (.cse23 (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base)) (.cse24 (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse0 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrncmp_~s1.base) (- 1))))))) (.cse2 (= 0 (select .cse23 (+ .cse24 (- 1))))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrncmp_~s1.base))))) (.cse11 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse8) .cse22)) (.cse13 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse24)) (.cse14 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse25 (- 1))))) (.cse15 (<= 1 .cse25)) (.cse4 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse1 (= .cse25 ULTIMATE.start_main_~length1~0)) (.cse18 (= 0 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse19 (= 0 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse6 (<= 1 |#StackHeapBarrier|)) (.cse21 (<= 1 .cse24)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse10 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse20 (<= 1 .cse16)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse17 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base)))) (or (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_cstrncmp_~n) .cse9 .cse10 .cse11 .cse12 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset) .cse13 .cse14 .cse15 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse16) .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse1 (<= 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) ULTIMATE.start_cstrncmp_~s1.offset)) .cse8 .cse21 .cse9 .cse10 .cse20 .cse12 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) .cse17) (and .cse1 .cse18 .cse19 .cse3 .cse5 .cse6 .cse8 .cse21 .cse9 .cse22 (= (select .cse23 ULTIMATE.start_cstrncmp_~s2.offset) 0) .cse10 (<= 1 ULTIMATE.start_main_~length1~0) .cse20 .cse12 .cse17)))) [2020-07-01 12:38:08,178 INFO L268 CegarLoopResult]: For program point L16-9(lines 16 23) no Hoare annotation was computed. [2020-07-01 12:38:08,178 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:08,178 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-07-01 12:38:08,178 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 12:38:08,178 INFO L268 CegarLoopResult]: For program point L35-1(lines 35 37) no Hoare annotation was computed. [2020-07-01 12:38:08,181 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:38:08,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,237 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,237 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,237 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,237 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,237 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:08 BasicIcfg [2020-07-01 12:38:08,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:38:08,246 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:38:08,246 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:38:08,250 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:38:08,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:08,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:37:53" (1/5) ... [2020-07-01 12:38:08,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a58b123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:08,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:53" (2/5) ... [2020-07-01 12:38:08,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a58b123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:08,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:54" (3/5) ... [2020-07-01 12:38:08,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a58b123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:08,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:54" (4/5) ... [2020-07-01 12:38:08,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a58b123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:08,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:08" (5/5) ... [2020-07-01 12:38:08,254 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:38:08,276 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:38:08,276 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:38:08,276 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:38:08,276 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:38:08,276 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:38:08,276 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:38:08,276 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:38:08,276 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:38:08,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 12:38:08,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:38:08,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:38:08,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:38:08,289 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:08,289 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:08,289 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:38:08,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 12:38:08,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:38:08,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:38:08,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:38:08,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:08,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:08,296 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [210] ULTIMATE.startENTRY-->L32: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 13#L32true [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 31#L32-2true [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 34#L35-1true [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc14.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc13.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 8#L40true [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 6#L40-1true [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 35#L13true [175] L13-->L16-8: Formula: (> 0 v_ULTIMATE.start_cstrncmp_~n_4) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 29#L16-8true [2020-07-01 12:38:08,297 INFO L796 eck$LassoCheckResult]: Loop: 29#L16-8true [177] L16-8-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 3#L16-1true [90] L16-1-->L16-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short3_5|) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_5|} AuxVars[] AssignedVars[] 12#L16-6true [187] L16-6-->L19: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9| (> 0 v_ULTIMATE.start_cstrncmp_~n_7)) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 30#L19true [127] L19-->L19-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 22#L19-4true [115] L19-4-->L16-8: Formula: (and (= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1) v_ULTIMATE.start_cstrncmp_~s2.offset_5) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6) (= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1) v_ULTIMATE.start_cstrncmp_~s1.offset_7)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 29#L16-8true [2020-07-01 12:38:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 1 times [2020-07-01 12:38:08,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:08,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927785386] [2020-07-01 12:38:08,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:08,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927785386] [2020-07-01 12:38:08,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:08,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:08,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164734290] [2020-07-01 12:38:08,312 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:38:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 194957317, now seen corresponding path program 1 times [2020-07-01 12:38:08,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:08,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792207448] [2020-07-01 12:38:08,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:08,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792207448] [2020-07-01 12:38:08,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:08,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:08,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148561851] [2020-07-01 12:38:08,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:38:08,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:08,324 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 12:38:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:08,420 INFO L93 Difference]: Finished difference Result 35 states and 66 transitions. [2020-07-01 12:38:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:08,423 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:38:08,427 INFO L168 Benchmark]: Toolchain (without parser) took 15031.37 ms. Allocated memory was 649.6 MB in the beginning and 900.2 MB in the end (delta: 250.6 MB). Free memory was 562.8 MB in the beginning and 454.5 MB in the end (delta: 108.2 MB). Peak memory consumption was 358.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,427 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:38:08,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.08 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 562.8 MB in the beginning and 641.5 MB in the end (delta: -78.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.49 ms. Allocated memory is still 679.5 MB. Free memory was 641.5 MB in the beginning and 638.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,428 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 ms. Allocated memory is still 679.5 MB. Free memory was 638.8 MB in the beginning and 637.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,429 INFO L168 Benchmark]: RCFGBuilder took 376.47 ms. Allocated memory is still 679.5 MB. Free memory was 637.4 MB in the beginning and 610.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,429 INFO L168 Benchmark]: BlockEncodingV2 took 125.69 ms. Allocated memory is still 679.5 MB. Free memory was 609.5 MB in the beginning and 600.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,429 INFO L168 Benchmark]: TraceAbstraction took 13947.11 ms. Allocated memory was 679.5 MB in the beginning and 900.2 MB in the end (delta: 220.7 MB). Free memory was 598.7 MB in the beginning and 481.8 MB in the end (delta: 116.9 MB). Peak memory consumption was 337.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,430 INFO L168 Benchmark]: BuchiAutomizer took 179.35 ms. Allocated memory is still 900.2 MB. Free memory was 481.8 MB in the beginning and 454.5 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:08,432 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 51 edges - StatisticsResult: Encoded RCFG 33 locations, 62 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 326.08 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 562.8 MB in the beginning and 641.5 MB in the end (delta: -78.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.49 ms. Allocated memory is still 679.5 MB. Free memory was 641.5 MB in the beginning and 638.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.25 ms. Allocated memory is still 679.5 MB. Free memory was 638.8 MB in the beginning and 637.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 376.47 ms. Allocated memory is still 679.5 MB. Free memory was 637.4 MB in the beginning and 610.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.69 ms. Allocated memory is still 679.5 MB. Free memory was 609.5 MB in the beginning and 600.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13947.11 ms. Allocated memory was 679.5 MB in the beginning and 900.2 MB in the end (delta: 220.7 MB). Free memory was 598.7 MB in the beginning and 481.8 MB in the end (delta: 116.9 MB). Peak memory consumption was 337.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 179.35 ms. Allocated memory is still 900.2 MB. Free memory was 481.8 MB in the beginning and 454.5 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:38:08,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:38:08,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:38:08,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:38:08,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:08,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:08,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:38:08,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString1] == length1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= s1) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == s1))) && unknown-#length-unknown[nondetString2] == length2) && 1 <= n) && 0 == nondetString2) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 == \valid[nondetString1]) && 1 <= s2) && s2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 1 <= unknown-#length-unknown[nondetString1]) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) || ((((((((((((((((((((\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString1] == length1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 == s2) && 0 == s1) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == s1))) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 1 <= unknown-#length-unknown[nondetString1]) && 1 == \valid[s1])) || (((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= length2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 0 == s2) && 0 == s1) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == unknown-#memory_int-unknown[s1][s1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[s2]) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString1]) && 1 == nondetString1 + length1) && 1 == \valid[s1])) || (((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == s2) && 0 == s1) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[s2]) && 0 == nondetString2) && 1 == length2 + nondetString2) && unknown-#memory_int-unknown[s2][s2] == 0) && 0 == nondetString1) && 1 <= length1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.9s, OverallIterations: 27, TraceHistogramMax: 4, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 268 SDtfs, 1949 SDslu, 963 SDs, 0 SdLazy, 2198 SolverSat, 171 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 211 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 47 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 454 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1263 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 551 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 632 ConstructedInterpolants, 67 QuantifiedInterpolants, 198997 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 35 InterpolantComputations, 21 PerfectInterpolantSequences, 116/279 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:37:50.127 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_om_G8A/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:38:08.702 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check