java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 23:29:30,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 23:29:30,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 23:29:30,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 23:29:30,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 23:29:30,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 23:29:30,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 23:29:30,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 23:29:30,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 23:29:30,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 23:29:30,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 23:29:30,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 23:29:30,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 23:29:30,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 23:29:30,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 23:29:30,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 23:29:30,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 23:29:30,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 23:29:30,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 23:29:30,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 23:29:30,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 23:29:30,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 23:29:30,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 23:29:30,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 23:29:30,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 23:29:30,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 23:29:30,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 23:29:30,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 23:29:30,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 23:29:30,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 23:29:30,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 23:29:30,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 23:29:30,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 23:29:30,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 23:29:30,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 23:29:30,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 23:29:30,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-23 23:29:30,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 23:29:30,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 23:29:30,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 23:29:30,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-23 23:29:30,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-23 23:29:30,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-23 23:29:30,460 INFO L133 SettingsManager]: * Use SBE=true [2018-07-23 23:29:30,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 23:29:30,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 23:29:30,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 23:29:30,462 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 23:29:30,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 23:29:30,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 23:29:30,462 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 23:29:30,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 23:29:30,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 23:29:30,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 23:29:30,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 23:29:30,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 23:29:30,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 23:29:30,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 23:29:30,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 23:29:30,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 23:29:30,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-23 23:29:30,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 23:29:30,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 23:29:30,466 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 23:29:30,467 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 23:29:30,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 23:29:30,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 23:29:30,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 23:29:30,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 23:29:30,556 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 23:29:30,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-07-23 23:29:30,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df61afcda/63312ed4af7d4fb6a60d5b903e01ff83/FLAG5093f8fcd [2018-07-23 23:29:31,098 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 23:29:31,099 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-07-23 23:29:31,105 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df61afcda/63312ed4af7d4fb6a60d5b903e01ff83/FLAG5093f8fcd [2018-07-23 23:29:31,121 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df61afcda/63312ed4af7d4fb6a60d5b903e01ff83 [2018-07-23 23:29:31,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 23:29:31,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 23:29:31,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:31,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 23:29:31,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 23:29:31,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42258277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31, skipping insertion in model container [2018-07-23 23:29:31,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,328 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 23:29:31,384 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:31,400 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 23:29:31,410 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:31,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31 WrapperNode [2018-07-23 23:29:31,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:31,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:31,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 23:29:31,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 23:29:31,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:31,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 23:29:31,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 23:29:31,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 23:29:31,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... [2018-07-23 23:29:31,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 23:29:31,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 23:29:31,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 23:29:31,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 23:29:31,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 23:29:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 23:29:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 23:29:31,945 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 23:29:31,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:31 BoogieIcfgContainer [2018-07-23 23:29:31,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 23:29:31,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 23:29:31,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 23:29:31,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 23:29:31,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 11:29:31" (1/3) ... [2018-07-23 23:29:31,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b0fbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:31, skipping insertion in model container [2018-07-23 23:29:31,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:31" (2/3) ... [2018-07-23 23:29:31,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b0fbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:31, skipping insertion in model container [2018-07-23 23:29:31,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:31" (3/3) ... [2018-07-23 23:29:31,960 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-07-23 23:29:31,981 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 23:29:32,004 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 23:29:32,089 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 23:29:32,090 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 23:29:32,090 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 23:29:32,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 23:29:32,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 23:29:32,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 23:29:32,091 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 23:29:32,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 23:29:32,092 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 23:29:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-07-23 23:29:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 23:29:32,115 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:32,116 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:32,116 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1947307858, now seen corresponding path program 1 times [2018-07-23 23:29:32,124 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:32,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:32,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:32,234 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:32,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 23:29:32,238 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-23 23:29:32,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-23 23:29:32,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 23:29:32,256 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-07-23 23:29:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:32,272 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-07-23 23:29:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-23 23:29:32,274 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-07-23 23:29:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:32,284 INFO L225 Difference]: With dead ends: 35 [2018-07-23 23:29:32,284 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 23:29:32,289 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 23:29:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 23:29:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 23:29:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 23:29:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-07-23 23:29:32,327 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-07-23 23:29:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:32,328 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-07-23 23:29:32,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-23 23:29:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-07-23 23:29:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 23:29:32,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:32,329 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:32,329 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1879837881, now seen corresponding path program 1 times [2018-07-23 23:29:32,330 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:32,605 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:32,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 23:29:32,607 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 23:29:32,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 23:29:32,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 23:29:32,608 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 4 states. [2018-07-23 23:29:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:32,745 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-07-23 23:29:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 23:29:32,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-07-23 23:29:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:32,747 INFO L225 Difference]: With dead ends: 28 [2018-07-23 23:29:32,747 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 23:29:32,750 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 23:29:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 23:29:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-07-23 23:29:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 23:29:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-07-23 23:29:32,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2018-07-23 23:29:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:32,759 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-07-23 23:29:32,760 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 23:29:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-07-23 23:29:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 23:29:32,760 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:32,761 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:32,761 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1544803704, now seen corresponding path program 1 times [2018-07-23 23:29:32,761 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:33,111 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-07-23 23:29:33,250 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-07-23 23:29:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:33,274 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:33,277 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:33,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:33,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:33,526 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-23 23:29:33,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-07-23 23:29:33,527 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 23:29:33,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 23:29:33,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 23:29:33,528 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2018-07-23 23:29:33,832 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-07-23 23:29:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:33,903 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-07-23 23:29:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 23:29:33,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-23 23:29:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:33,905 INFO L225 Difference]: With dead ends: 47 [2018-07-23 23:29:33,905 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 23:29:33,906 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 23:29:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 23:29:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-07-23 23:29:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 23:29:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-07-23 23:29:33,912 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-07-23 23:29:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-07-23 23:29:33,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 23:29:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-07-23 23:29:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 23:29:33,913 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:33,914 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:33,914 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1113820709, now seen corresponding path program 1 times [2018-07-23 23:29:33,915 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:33,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:34,454 WARN L169 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-07-23 23:29:34,728 WARN L169 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-07-23 23:29:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:34,749 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:34,749 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:34,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:35,123 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:35,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,132 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:35,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-07-23 23:29:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:35,533 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:35,533 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-07-23 23:29:35,534 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 23:29:35,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 23:29:35,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-07-23 23:29:35,535 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 15 states. [2018-07-23 23:29:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:36,632 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-07-23 23:29:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 23:29:36,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-07-23 23:29:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:36,635 INFO L225 Difference]: With dead ends: 36 [2018-07-23 23:29:36,635 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 23:29:36,636 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-07-23 23:29:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 23:29:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-07-23 23:29:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 23:29:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-07-23 23:29:36,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2018-07-23 23:29:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:36,643 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-07-23 23:29:36,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 23:29:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-07-23 23:29:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 23:29:36,644 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:36,644 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:36,645 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1837316842, now seen corresponding path program 2 times [2018-07-23 23:29:36,646 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:36,962 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:36,962 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:36,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:36,985 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:36,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:36,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:37,227 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:37,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,235 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:37,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-07-23 23:29:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:37,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:37,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-07-23 23:29:37,547 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:29:37,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:29:37,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:37,548 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2018-07-23 23:29:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:38,645 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-07-23 23:29:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 23:29:38,646 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-07-23 23:29:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:38,647 INFO L225 Difference]: With dead ends: 47 [2018-07-23 23:29:38,647 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 23:29:38,648 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:29:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 23:29:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-07-23 23:29:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 23:29:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-07-23 23:29:38,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-07-23 23:29:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:38,655 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-07-23 23:29:38,656 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:29:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-07-23 23:29:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 23:29:38,657 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:38,657 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:38,657 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 930243579, now seen corresponding path program 3 times [2018-07-23 23:29:38,658 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:29:39,056 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:39,056 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:39,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-07-23 23:29:39,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:39,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-23 23:29:39,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:39,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-07-23 23:29:39,154 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 23:29:39,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 23:29:39,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-23 23:29:39,156 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2018-07-23 23:29:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:39,952 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-07-23 23:29:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 23:29:39,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-07-23 23:29:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:39,954 INFO L225 Difference]: With dead ends: 84 [2018-07-23 23:29:39,954 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 23:29:39,955 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 23:29:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 36. [2018-07-23 23:29:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 23:29:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-07-23 23:29:39,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2018-07-23 23:29:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-07-23 23:29:39,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 23:29:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-07-23 23:29:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 23:29:39,965 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:39,965 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:39,965 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1048477048, now seen corresponding path program 4 times [2018-07-23 23:29:39,966 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:39,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:39,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 23:29:40,282 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:40,282 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:40,311 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:40,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:40,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:40,714 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:40,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,725 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:40,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-07-23 23:29:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-23 23:29:41,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:41,463 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 20 [2018-07-23 23:29:41,464 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:29:41,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:29:41,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:41,465 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 20 states. [2018-07-23 23:29:42,789 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-07-23 23:29:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:42,912 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-07-23 23:29:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 23:29:42,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-07-23 23:29:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:42,914 INFO L225 Difference]: With dead ends: 84 [2018-07-23 23:29:42,914 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 23:29:42,915 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:29:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 23:29:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-07-23 23:29:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 23:29:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-07-23 23:29:42,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 33 [2018-07-23 23:29:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:42,948 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-07-23 23:29:42,948 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:29:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-07-23 23:29:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 23:29:42,950 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:42,950 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:42,950 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1179374245, now seen corresponding path program 5 times [2018-07-23 23:29:42,950 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:42,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-07-23 23:29:43,271 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:43,271 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:43,278 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:29:43,353 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-23 23:29:43,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:43,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:43,891 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:43,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,893 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:43,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-07-23 23:29:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-23 23:29:44,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:44,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 23 [2018-07-23 23:29:44,211 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 23:29:44,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 23:29:44,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-07-23 23:29:44,212 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 23 states. [2018-07-23 23:29:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:45,299 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-07-23 23:29:45,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 23:29:45,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-07-23 23:29:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:45,300 INFO L225 Difference]: With dead ends: 101 [2018-07-23 23:29:45,300 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 23:29:45,301 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:29:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 23:29:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2018-07-23 23:29:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 23:29:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-07-23 23:29:45,312 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-07-23 23:29:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:45,313 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-07-23 23:29:45,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 23:29:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-07-23 23:29:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:29:45,314 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:45,314 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:45,314 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1296364612, now seen corresponding path program 1 times [2018-07-23 23:29:45,315 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:45,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-23 23:29:45,641 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:45,641 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:45,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:46,476 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:46,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,491 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:46,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:29:46,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:55 [2018-07-23 23:29:46,665 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:46,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 17 [2018-07-23 23:29:46,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:36 [2018-07-23 23:29:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-23 23:29:47,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:47,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20] total 26 [2018-07-23 23:29:47,638 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:29:47,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:29:47,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:29:47,640 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 26 states. [2018-07-23 23:29:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:49,307 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-07-23 23:29:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 23:29:49,311 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-07-23 23:29:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:49,312 INFO L225 Difference]: With dead ends: 119 [2018-07-23 23:29:49,312 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 23:29:49,313 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 23:29:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 23:29:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2018-07-23 23:29:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 23:29:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-07-23 23:29:49,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 44 [2018-07-23 23:29:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:49,326 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-07-23 23:29:49,326 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:29:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-07-23 23:29:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:29:49,327 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:49,328 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:49,328 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2064084394, now seen corresponding path program 6 times [2018-07-23 23:29:49,328 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:49,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:49,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:49,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:49,764 WARN L169 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-07-23 23:29:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 23:29:49,945 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:49,945 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:29:50,006 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-07-23 23:29:50,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:50,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:50,635 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:50,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:50,638 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:29:50,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:50,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:50,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-07-23 23:29:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 23:29:50,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:50,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 28 [2018-07-23 23:29:50,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 23:29:50,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 23:29:50,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:29:50,976 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 28 states. [2018-07-23 23:29:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:52,703 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-07-23 23:29:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 23:29:52,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-07-23 23:29:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:52,704 INFO L225 Difference]: With dead ends: 87 [2018-07-23 23:29:52,704 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 23:29:52,705 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 23:29:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 23:29:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2018-07-23 23:29:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 23:29:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-07-23 23:29:52,719 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2018-07-23 23:29:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:52,719 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-07-23 23:29:52,719 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 23:29:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-07-23 23:29:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 23:29:52,720 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:52,720 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:52,721 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2000485770, now seen corresponding path program 2 times [2018-07-23 23:29:52,721 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:52,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:52,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:52,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:52,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:53,771 WARN L169 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-07-23 23:29:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-23 23:29:54,518 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:54,518 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:54,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:54,555 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:54,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:54,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:54,790 INFO L477 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 0 case distinctions, treesize of input 35 treesize of output 34 [2018-07-23 23:29:54,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,792 INFO L477 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 0 case distinctions, treesize of input 36 treesize of output 35 [2018-07-23 23:29:54,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:29:54,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:70 [2018-07-23 23:29:54,961 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 48 treesize of output 53 [2018-07-23 23:29:54,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,995 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 49 treesize of output 54 [2018-07-23 23:29:54,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:55,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:29:55,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:96 [2018-07-23 23:29:55,210 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:29:55,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:55,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-23 23:29:55,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:55,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:55,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:53 [2018-07-23 23:29:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-23 23:29:59,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:59,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2018-07-23 23:29:59,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 23:29:59,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 23:29:59,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1412, Unknown=1, NotChecked=0, Total=1560 [2018-07-23 23:29:59,436 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 40 states. [2018-07-23 23:30:01,133 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2018-07-23 23:30:01,703 WARN L169 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2018-07-23 23:30:01,917 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2018-07-23 23:30:02,420 WARN L169 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2018-07-23 23:30:03,080 WARN L169 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-07-23 23:30:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:04,883 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-07-23 23:30:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 23:30:04,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-07-23 23:30:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:04,891 INFO L225 Difference]: With dead ends: 64 [2018-07-23 23:30:04,891 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 23:30:04,893 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=459, Invalid=3446, Unknown=1, NotChecked=0, Total=3906 [2018-07-23 23:30:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 23:30:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-07-23 23:30:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 23:30:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-07-23 23:30:04,909 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-07-23 23:30:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-07-23 23:30:04,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 23:30:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-07-23 23:30:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 23:30:04,911 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:04,911 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:04,912 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1041218234, now seen corresponding path program 3 times [2018-07-23 23:30:04,912 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:05,365 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:30:05,908 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-07-23 23:30:06,094 WARN L169 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-07-23 23:30:06,252 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-07-23 23:30:06,414 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-07-23 23:30:06,569 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-07-23 23:30:07,058 WARN L169 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-07-23 23:30:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 15 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:30:07,809 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:07,809 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:07,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:07,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-07-23 23:30:07,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:07,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:08,235 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-07-23 23:30:08,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:30:08,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 17 [2018-07-23 23:30:08,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2018-07-23 23:30:08,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-23 23:30:08,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2018-07-23 23:30:09,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-07-23 23:30:09,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2018-07-23 23:30:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:30:14,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:14,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-07-23 23:30:14,293 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 23:30:14,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 23:30:14,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2301, Unknown=2, NotChecked=0, Total=2450 [2018-07-23 23:30:14,295 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 50 states. [2018-07-23 23:30:15,752 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 37 [2018-07-23 23:30:16,186 WARN L169 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2018-07-23 23:30:16,796 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2018-07-23 23:30:17,765 WARN L169 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 49 [2018-07-23 23:30:18,371 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2018-07-23 23:30:18,846 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-07-23 23:30:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:19,689 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-07-23 23:30:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:30:19,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-07-23 23:30:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:19,691 INFO L225 Difference]: With dead ends: 69 [2018-07-23 23:30:19,691 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 23:30:19,693 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=496, Invalid=4758, Unknown=2, NotChecked=0, Total=5256 [2018-07-23 23:30:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 23:30:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-07-23 23:30:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 23:30:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-07-23 23:30:19,709 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2018-07-23 23:30:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:19,710 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-07-23 23:30:19,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 23:30:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-07-23 23:30:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 23:30:19,711 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:19,711 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:19,711 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1068254326, now seen corresponding path program 4 times [2018-07-23 23:30:19,712 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:19,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:19,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:20,290 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2018-07-23 23:30:20,413 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-07-23 23:30:20,658 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2018-07-23 23:30:20,909 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2018-07-23 23:30:21,043 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-07-23 23:30:21,223 WARN L169 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-07-23 23:30:21,402 WARN L169 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2018-07-23 23:30:21,570 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2018-07-23 23:30:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:22,567 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:22,567 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:22,605 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:22,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:22,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:22,781 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 27 [2018-07-23 23:30:22,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:22,783 INFO L477 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 0 case distinctions, treesize of input 26 treesize of output 25 [2018-07-23 23:30:22,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:22,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:30:22,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-07-23 23:30:22,961 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:22,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 41 treesize of output 46 [2018-07-23 23:30:22,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:22,992 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:22,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 41 treesize of output 46 [2018-07-23 23:30:22,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:30:23,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-07-23 23:30:23,208 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,210 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,211 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-07-23 23:30:23,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,258 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,259 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,260 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-07-23 23:30:23,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:30:23,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:103 [2018-07-23 23:30:23,536 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,536 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,537 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,538 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,539 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,541 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 104 [2018-07-23 23:30:23,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,603 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,604 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,605 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,606 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,607 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,608 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 104 [2018-07-23 23:30:23,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:30:23,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:125 [2018-07-23 23:30:23,927 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-07-23 23:30:23,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-07-23 23:30:23,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:63 [2018-07-23 23:30:24,671 WARN L169 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2018-07-23 23:30:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 23:30:25,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:25,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 58 [2018-07-23 23:30:25,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 23:30:25,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 23:30:25,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2974, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 23:30:25,856 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 58 states. [2018-07-23 23:30:26,562 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-07-23 23:30:27,211 WARN L169 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2018-07-23 23:30:27,582 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-07-23 23:30:27,908 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-07-23 23:30:28,408 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-07-23 23:30:30,068 WARN L169 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-07-23 23:30:30,513 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 38 [2018-07-23 23:30:30,836 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-07-23 23:30:31,130 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2018-07-23 23:30:32,468 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2018-07-23 23:30:32,912 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-07-23 23:30:33,487 WARN L169 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-07-23 23:30:33,918 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2018-07-23 23:30:34,219 WARN L169 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-07-23 23:30:34,545 WARN L169 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2018-07-23 23:30:34,833 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-07-23 23:30:35,080 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2018-07-23 23:30:35,319 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-07-23 23:30:35,566 WARN L169 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2018-07-23 23:30:35,792 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-07-23 23:30:36,013 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-07-23 23:30:36,238 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-07-23 23:30:36,461 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-07-23 23:30:36,893 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-07-23 23:30:37,307 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-07-23 23:30:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:37,317 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-07-23 23:30:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 23:30:37,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 62 [2018-07-23 23:30:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:37,320 INFO L225 Difference]: With dead ends: 104 [2018-07-23 23:30:37,320 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 23:30:37,323 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1350, Invalid=9156, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 23:30:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 23:30:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2018-07-23 23:30:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 23:30:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-07-23 23:30:37,344 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2018-07-23 23:30:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-07-23 23:30:37,345 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 23:30:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-07-23 23:30:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 23:30:37,346 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:37,346 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:37,346 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1803533498, now seen corresponding path program 5 times [2018-07-23 23:30:37,347 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:37,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-07-23 23:30:37,764 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:37,764 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:37,771 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:31:04,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 23:31:04,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:04,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-07-23 23:31:04,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:04,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-07-23 23:31:04,664 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 23:31:04,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 23:31:04,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:31:04,665 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 16 states. [2018-07-23 23:31:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:04,899 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-07-23 23:31:04,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 23:31:04,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-07-23 23:31:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:04,900 INFO L225 Difference]: With dead ends: 117 [2018-07-23 23:31:04,900 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 23:31:04,901 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:31:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 23:31:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 23:31:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 23:31:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 23:31:04,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-07-23 23:31:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:04,903 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 23:31:04,903 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 23:31:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 23:31:04,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 23:31:04,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 23:31:05,068 WARN L169 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 263 [2018-07-23 23:31:05,310 WARN L169 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 267 [2018-07-23 23:31:08,668 WARN L169 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 262 DAG size of output: 132 [2018-07-23 23:31:08,943 WARN L169 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 27 [2018-07-23 23:31:10,060 WARN L169 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 267 DAG size of output: 141 [2018-07-23 23:31:10,776 WARN L169 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 93 [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point L30''(lines 30 33) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point L24''(lines 24 27) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 33) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point L16''''(lines 16 18) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-23 23:31:10,779 INFO L417 ceAbstractionStarter]: At program point L16'''(lines 16 18) the Hoare annotation is: (let ((.cse0 (<= 5 ULTIMATE.start_main_~max~0)) (.cse1 (<= ULTIMATE.start_main_~max~0 5))) (or (and (<= (+ (* 4294967296 (div (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296)) ULTIMATE.start_main_~i~0) 4294967299) .cse0 .cse1 (<= 0 ULTIMATE.start_main_~i~0)) (let ((.cse2 (+ ULTIMATE.start_main_~i~0 1))) (and (<= 4 ULTIMATE.start_main_~i~0) (<= .cse2 ULTIMATE.start_main_~max~0) (<= ULTIMATE.start_main_~i~0 4) (<= ULTIMATE.start_main_~max~0 .cse2))) (and .cse0 (= ULTIMATE.start_main_~i~0 5) .cse1))) [2018-07-23 23:31:10,779 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L421 ceAbstractionStarter]: For program point L24''''(lines 24 27) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L421 ceAbstractionStarter]: For program point L16''(lines 16 18) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L421 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L421 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-07-23 23:31:10,780 INFO L417 ceAbstractionStarter]: At program point L4''(lines 3 8) the Hoare annotation is: (let ((.cse19 (+ ULTIMATE.start_main_~max~0 4294967295))) (let ((.cse22 (div .cse19 4294967296))) (let ((.cse18 (= ULTIMATE.start_main_~i~0 1)) (.cse4 (= ULTIMATE.start_main_~i~0 0)) (.cse21 (* 4294967296 .cse22))) (let ((.cse11 (let ((.cse23 (<= 5 ULTIMATE.start_main_~max~0)) (.cse24 (<= ULTIMATE.start_main_~max~0 5))) (or (and .cse23 .cse18 .cse24) (and .cse4 .cse23 .cse24) (and .cse23 (<= 4294967298 (+ .cse21 ULTIMATE.start_main_~i~0)) .cse24))))) (let ((.cse12 (let ((.cse20 (* (- 4294967296) .cse22))) (and (not (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_invert_string_true_unreach_call_true_termination_i____VERIFIER_assert_~cond 0)) (= (select ULTIMATE.start_main_~str1~0 (+ .cse20 ULTIMATE.start_main_~max~0 4294967291)) (select ULTIMATE.start_main_~str2~0 4)) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse20 ULTIMATE.start_main_~max~0 4294967292))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse20 ULTIMATE.start_main_~max~0 4294967293))) (or (not .cse4) (not (= (+ .cse21 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~max~0 4294967293)))) .cse11))) (.cse2 (select ULTIMATE.start_main_~str2~0 1)) (.cse16 (mod .cse19 4294967296))) (let ((.cse3 (+ ULTIMATE.start_main_~i~0 3)) (.cse15 (and .cse12 (= .cse2 (select ULTIMATE.start_main_~str1~0 (+ .cse16 (- 1)))))) (.cse0 (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 4))) (.cse1 (= 1 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_invert_string_true_unreach_call_true_termination_i____VERIFIER_assert_~cond))) (or (and .cse0 .cse1 (= .cse2 (select ULTIMATE.start_main_~str1~0 .cse3)) .cse4 (exists ((v_prenex_10 Int)) (let ((.cse9 (+ v_prenex_10 4294967295))) (let ((.cse10 (div .cse9 4294967296))) (let ((.cse6 (* 4294967296 .cse10)) (.cse5 (+ v_prenex_10 4294967291)) (.cse7 (* (- 4294967296) .cse10)) (.cse8 (mod .cse9 4294967296))) (and (<= .cse5 .cse6) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse7 v_prenex_10 4294967292))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse7 v_prenex_10 4294967293))) (= ULTIMATE.start_main_~j~0 .cse8) (<= .cse6 .cse5) (= (select ULTIMATE.start_main_~str1~0 (+ .cse7 v_prenex_10 4294967291)) (select ULTIMATE.start_main_~str2~0 4)) (<= .cse8 2147483647)))))) .cse11) (and .cse1 (<= 2 ULTIMATE.start_main_~i~0) .cse12 (<= .cse3 ULTIMATE.start_main_~max~0) (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse13 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse13)) (<= 4 .cse13) (= (+ ULTIMATE.start_main_~j~0 2) .cse13) (<= .cse13 2147483647) (< .cse13 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse13 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse13 (- 1)))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse13 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse13 (- 3)))))))) (and (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse14 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse14)) (<= 4 .cse14) (= (+ ULTIMATE.start_main_~j~0 3) .cse14) (<= .cse14 2147483647) (< .cse14 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse14 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse14 (- 1)))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse14 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse14 (- 3))))))) .cse1 .cse15 (= (+ ULTIMATE.start_main_~i~0 1) .cse16)) (and (and .cse15 .cse0) (= ULTIMATE.start_main_~i~0 4)) (and .cse11 (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse17 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse17)) (<= 4 .cse17) (<= .cse17 2147483647) (< .cse17 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse17 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse17 (- 1)))) (= (+ ULTIMATE.start_main_~j~0 1) .cse17) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse17 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse17 (- 3))))))) .cse1 .cse18)))))))) [2018-07-23 23:31:10,781 INFO L417 ceAbstractionStarter]: At program point L30'''(lines 30 33) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_main_~max~0 4294967295))) (let ((.cse24 (div .cse21 4294967296))) (let ((.cse9 (= ULTIMATE.start_main_~i~0 1)) (.cse11 (= ULTIMATE.start_main_~i~0 0)) (.cse23 (* 4294967296 .cse24)) (.cse8 (<= 5 ULTIMATE.start_main_~max~0)) (.cse6 (<= ULTIMATE.start_main_~max~0 5))) (let ((.cse1 (and (or .cse9 .cse11 (<= 4294967298 (+ .cse23 ULTIMATE.start_main_~i~0))) .cse8 .cse6))) (let ((.cse10 (select ULTIMATE.start_main_~str2~0 1)) (.cse20 (let ((.cse22 (* (- 4294967296) .cse24))) (and (not (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_invert_string_true_unreach_call_true_termination_i____VERIFIER_assert_~cond 0)) (= (select ULTIMATE.start_main_~str1~0 (+ .cse22 ULTIMATE.start_main_~max~0 4294967291)) (select ULTIMATE.start_main_~str2~0 4)) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse22 ULTIMATE.start_main_~max~0 4294967292))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse22 ULTIMATE.start_main_~max~0 4294967293))) (or (not .cse11) (not (= (+ .cse23 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~max~0 4294967293)))) .cse1)))) (let ((.cse4 (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 4))) (.cse2 (+ ULTIMATE.start_main_~i~0 3)) (.cse5 (and (= .cse10 (select ULTIMATE.start_main_~str1~0 (+ (mod .cse21 4294967296) (- 1)))) .cse20)) (.cse0 (= 1 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_invert_string_true_unreach_call_true_termination_i____VERIFIER_assert_~cond))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~i~0) .cse1 (<= .cse2 ULTIMATE.start_main_~max~0) (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse3 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse3)) (<= 4 .cse3) (= (+ ULTIMATE.start_main_~j~0 2) .cse3) (<= .cse3 2147483647) (< .cse3 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse3 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse3 (- 1)))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse3 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse3 (- 3)))))))) (and (and .cse4 .cse5) (= ULTIMATE.start_main_~i~0 5)) (and .cse6 (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse7 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse7)) (<= 4 .cse7) (<= .cse7 2147483647) (< .cse7 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse7 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse7 (- 1)))) (= (+ ULTIMATE.start_main_~j~0 1) .cse7) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse7 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse7 (- 3))))))) .cse0 .cse8 .cse9) (and .cse4 (<= ULTIMATE.start_main_~max~0 (+ ULTIMATE.start_main_~i~0 5)) (= .cse10 (select ULTIMATE.start_main_~str1~0 .cse2)) .cse11 .cse8 (exists ((v_prenex_10 Int)) (let ((.cse16 (+ v_prenex_10 4294967295))) (let ((.cse17 (div .cse16 4294967296))) (let ((.cse13 (* 4294967296 .cse17)) (.cse12 (+ v_prenex_10 4294967291)) (.cse14 (* (- 4294967296) .cse17)) (.cse15 (mod .cse16 4294967296))) (and (<= .cse12 .cse13) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse14 v_prenex_10 4294967292))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse14 v_prenex_10 4294967293))) (= ULTIMATE.start_main_~j~0 .cse15) (<= .cse13 .cse12) (= (select ULTIMATE.start_main_~str1~0 (+ .cse14 v_prenex_10 4294967291)) (select ULTIMATE.start_main_~str2~0 4)) (<= .cse15 2147483647))))))) (and .cse0 (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse18 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse18)) (<= 4 .cse18) (<= .cse18 2147483647) (< .cse18 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse18 (- 4)))) (= (+ ULTIMATE.start_main_~j~0 4) .cse18) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse18 (- 1)))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse18 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse18 (- 3))))))) .cse5 (<= ULTIMATE.start_main_~i~0 4) (<= ULTIMATE.start_main_~max~0 (+ ULTIMATE.start_main_~i~0 1))) (and (exists ((ULTIMATE.start_main_~max~0 Int)) (let ((.cse19 (mod (+ ULTIMATE.start_main_~max~0 4294967295) 4294967296))) (and (= (select ULTIMATE.start_main_~str2~0 0) (select ULTIMATE.start_main_~str1~0 .cse19)) (<= 4 .cse19) (= (+ ULTIMATE.start_main_~j~0 3) .cse19) (<= .cse19 2147483647) (< .cse19 5) (= (select ULTIMATE.start_main_~str2~0 4) (select ULTIMATE.start_main_~str1~0 (+ .cse19 (- 4)))) (= (select ULTIMATE.start_main_~str2~0 1) (select ULTIMATE.start_main_~str1~0 (+ .cse19 (- 1)))) (= (select ULTIMATE.start_main_~str2~0 2) (select ULTIMATE.start_main_~str1~0 (+ .cse19 (- 2)))) (= (select ULTIMATE.start_main_~str2~0 3) (select ULTIMATE.start_main_~str1~0 (+ .cse19 (- 3))))))) .cse0 (<= ULTIMATE.start_main_~i~0 3) .cse20 (<= ULTIMATE.start_main_~max~0 (+ ULTIMATE.start_main_~i~0 2)))))))))) [2018-07-23 23:31:10,781 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-07-23 23:31:10,781 INFO L421 ceAbstractionStarter]: For program point L11(lines 11 34) no Hoare annotation was computed. [2018-07-23 23:31:10,781 INFO L421 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-07-23 23:31:10,782 INFO L417 ceAbstractionStarter]: At program point L24'''(lines 24 27) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_main_~max~0 4294967295))) (let ((.cse3 (div .cse15 4294967296))) (let ((.cse12 (+ ULTIMATE.start_main_~i~0 1)) (.cse5 (+ ULTIMATE.start_main_~i~0 3)) (.cse2 (select ULTIMATE.start_main_~str1~0 (+ ULTIMATE.start_main_~i~0 2))) (.cse11 (* 4294967296 .cse3))) (let ((.cse4 (+ .cse11 ULTIMATE.start_main_~i~0)) (.cse6 (= (select ULTIMATE.start_main_~str2~0 (+ ULTIMATE.start_main_~j~0 (- 2))) .cse2)) (.cse0 (<= ULTIMATE.start_main_~max~0 5)) (.cse8 (select ULTIMATE.start_main_~str2~0 2)) (.cse7 (select ULTIMATE.start_main_~str1~0 .cse5)) (.cse9 (select ULTIMATE.start_main_~str1~0 .cse12)) (.cse10 (<= 5 ULTIMATE.start_main_~max~0)) (.cse13 (select ULTIMATE.start_main_~str2~0 3)) (.cse14 (+ ULTIMATE.start_main_~i~0 5)) (.cse1 (select ULTIMATE.start_main_~str2~0 0))) (or (and (= ULTIMATE.start_main_~j~0 2) .cse0 (= .cse1 .cse2) (= (select ULTIMATE.start_main_~str1~0 (+ 0 3)) (select ULTIMATE.start_main_~str2~0 (+ (* (- 4294967296) .cse3) (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~max~0 4294967294))) (<= 4294967298 .cse4) (<= .cse5 ULTIMATE.start_main_~max~0)) (and .cse6 (= ULTIMATE.start_main_~j~0 3) (= .cse1 .cse7) (= .cse8 .cse9) .cse10 (= .cse4 (+ ULTIMATE.start_main_~max~0 4294967292)) (= ULTIMATE.start_main_~i~0 1) (<= .cse11 4294967296)) (and (<= ULTIMATE.start_main_~max~0 .cse12) .cse10 (= ULTIMATE.start_main_~j~0 0) (<= ULTIMATE.start_main_~i~0 4)) (and (= .cse1 .cse9) .cse0 (= 1 ULTIMATE.start_main_~j~0) .cse10 (= .cse4 (+ ULTIMATE.start_main_~max~0 4294967294))) (and .cse6 (= .cse1 (select ULTIMATE.start_main_~str1~0 4)) (= .cse13 .cse9) (<= ULTIMATE.start_main_~max~0 .cse14) (= (select ULTIMATE.start_main_~str2~0 (+ ULTIMATE.start_main_~j~0 (- 3))) .cse7) (= ULTIMATE.start_main_~i~0 0) .cse10 (= ULTIMATE.start_main_~j~0 4)) (and (= .cse14 (mod .cse15 4294967296)) .cse0 (= (select ULTIMATE.start_main_~str1~0 (+ ULTIMATE.start_main_~i~0 4)) (select ULTIMATE.start_main_~str2~0 1)) (= .cse8 .cse7) (= ULTIMATE.start_main_~j~0 5) (= (select ULTIMATE.start_main_~str2~0 4) .cse9) .cse10 (= .cse13 .cse2) (= (select ULTIMATE.start_main_~str1~0 .cse14) .cse1))))))) [2018-07-23 23:31:10,782 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-23 23:31:10,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 11:31:10 BoogieIcfgContainer [2018-07-23 23:31:10,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 23:31:10,840 INFO L168 Benchmark]: Toolchain (without parser) took 99706.04 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -578.0 MB). Peak memory consumption was 654.6 MB. Max. memory is 7.1 GB. [2018-07-23 23:31:10,841 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:31:10,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 23:31:10,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:31:10,842 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:31:10,842 INFO L168 Benchmark]: RCFGBuilder took 433.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-07-23 23:31:10,843 INFO L168 Benchmark]: TraceAbstraction took 98891.55 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 207.8 MB). Peak memory consumption was 695.4 MB. Max. memory is 7.1 GB. [2018-07-23 23:31:10,846 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 433.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98891.55 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 207.8 MB). Peak memory consumption was 695.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant [2018-07-23 23:31:10,854 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: ((((((((str2[0] == str1[4] && 1 == cond) && str2[1] == str1[i + 3]) && i == 0) && (\exists v_prenex_10 : int :: (((((v_prenex_10 + 4294967291 <= 4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) && str2[3] == str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967292]) && str2[2] == str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967293]) && j == (v_prenex_10 + 4294967295) % 4294967296) && 4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) <= v_prenex_10 + 4294967291) && str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967291] == str2[4]) && (v_prenex_10 + 4294967295) % 4294967296 <= 2147483647)) && ((((5 <= max && i == 1) && max <= 5) || ((i == 0 && 5 <= max) && max <= 5)) || ((5 <= max && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && max <= 5))) || ((((1 == cond && 2 <= i) && ((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && ((((5 <= max && i == 1) && max <= 5) || ((i == 0 && 5 <= max) && max <= 5)) || ((5 <= max && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && max <= 5))) && i + 3 <= max) && (\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && j + 2 == (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3]))) || ((((\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && j + 3 == (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3]) && 1 == cond) && (((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && ((((5 <= max && i == 1) && max <= 5) || ((i == 0 && 5 <= max) && max <= 5)) || ((5 <= max && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && max <= 5))) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && i + 1 == (max + 4294967295) % 4294967296)) || ((((((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && ((((5 <= max && i == 1) && max <= 5) || ((i == 0 && 5 <= max) && max <= 5)) || ((5 <= max && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && max <= 5))) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[0] == str1[4]) && i == 4)) || (((((((5 <= max && i == 1) && max <= 5) || ((i == 0 && 5 <= max) && max <= 5)) || ((5 <= max && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && max <= 5)) && (\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && j + 1 == (max + 4294967295) % 4294967296) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3])) && 1 == cond) && i == 1) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((4294967296 * ((max + 4294967295) / 4294967296) + i <= 4294967299 && 5 <= max) && max <= 5) && 0 <= i) || (((4 <= i && i + 1 <= max) && i <= 4) && max <= i + 1)) || ((5 <= max && i == 5) && max <= 5) - InvariantResult [Line: 30]: Loop Invariant [2018-07-23 23:31:10,865 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-07-23 23:31:10,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: ((((((((1 == cond && 2 <= i) && (((i == 1 || i == 0) || 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && 5 <= max) && max <= 5) && i + 3 <= max) && (\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && j + 2 == (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3])) || ((str2[0] == str1[4] && str2[1] == str1[(max + 4294967295) % 4294967296 + -1] && ((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && (((i == 1 || i == 0) || 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && 5 <= max) && max <= 5) && i == 5)) || ((((max <= 5 && (\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && j + 1 == (max + 4294967295) % 4294967296) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3])) && 1 == cond) && 5 <= max) && i == 1)) || (((((str2[0] == str1[4] && max <= i + 5) && str2[1] == str1[i + 3]) && i == 0) && 5 <= max) && (\exists v_prenex_10 : int :: (((((v_prenex_10 + 4294967291 <= 4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) && str2[3] == str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967292]) && str2[2] == str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967293]) && j == (v_prenex_10 + 4294967295) % 4294967296) && 4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) <= v_prenex_10 + 4294967291) && str1[-4294967296 * ((v_prenex_10 + 4294967295) / 4294967296) + v_prenex_10 + 4294967291] == str2[4]) && (v_prenex_10 + 4294967295) % 4294967296 <= 2147483647))) || ((((1 == cond && (\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && j + 4 == (max + 4294967295) % 4294967296) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3])) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1] && ((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && (((i == 1 || i == 0) || 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && 5 <= max) && max <= 5) && i <= 4) && max <= i + 1)) || (((((\exists ULTIMATE.start_main_~max~0 : int :: (((((((str2[0] == str1[(max + 4294967295) % 4294967296] && 4 <= (max + 4294967295) % 4294967296) && j + 3 == (max + 4294967295) % 4294967296) && (max + 4294967295) % 4294967296 <= 2147483647) && (max + 4294967295) % 4294967296 < 5) && str2[4] == str1[(max + 4294967295) % 4294967296 + -4]) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3]) && 1 == cond) && i <= 3) && ((((!(cond == 0) && str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967291] == str2[4]) && str2[3] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967292]) && str2[2] == str1[-4294967296 * ((max + 4294967295) / 4294967296) + max + 4294967293]) && (!(i == 0) || !(4294967296 * ((max + 4294967295) / 4294967296) + i + j == max + 4294967293))) && (((i == 1 || i == 0) || 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && 5 <= max) && max <= 5) && max <= i + 2) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((j == 2 && max <= 5) && str2[0] == str1[i + 2]) && str1[0 + 3] == str2[-4294967296 * ((max + 4294967295) / 4294967296) + -1 * i + max + 4294967294]) && 4294967298 <= 4294967296 * ((max + 4294967295) / 4294967296) + i) && i + 3 <= max) || (((((((str2[j + -2] == str1[i + 2] && j == 3) && str2[0] == str1[i + 3]) && str2[2] == str1[i + 1]) && 5 <= max) && 4294967296 * ((max + 4294967295) / 4294967296) + i == max + 4294967292) && i == 1) && 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967296)) || (((max <= i + 1 && 5 <= max) && j == 0) && i <= 4)) || ((((str2[0] == str1[i + 1] && max <= 5) && 1 == j) && 5 <= max) && 4294967296 * ((max + 4294967295) / 4294967296) + i == max + 4294967294)) || (((((((str2[j + -2] == str1[i + 2] && str2[0] == str1[4]) && str2[3] == str1[i + 1]) && max <= i + 5) && str2[j + -3] == str1[i + 3]) && i == 0) && 5 <= max) && j == 4)) || ((((((((i + 5 == (max + 4294967295) % 4294967296 && max <= 5) && str1[i + 4] == str2[1]) && str2[2] == str1[i + 3]) && j == 5) && str2[4] == str1[i + 1]) && 5 <= max) && str2[3] == str1[i + 2]) && str1[i + 5] == str2[0]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 98.7s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 1160 SDslu, 3287 SDs, 0 SdLazy, 6260 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 347 SyntacticMatches, 14 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5029 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 153 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 28 NumberOfFragments, 2112 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1671388 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 623441 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 27.1s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 974 ConstructedInterpolants, 68 QuantifiedInterpolants, 1131637 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 433 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 570/1646 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_23-31-10-882.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_23-31-10-882.csv Received shutdown request...