java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:08:49,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:08:49,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:08:49,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:08:49,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:08:49,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:08:49,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:08:49,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:08:49,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:08:49,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:08:49,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:08:49,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:08:49,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:08:49,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:08:49,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:08:49,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:08:49,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:08:49,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:08:49,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:08:49,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:08:49,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:08:49,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:08:49,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:08:49,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:08:49,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:08:49,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:08:49,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:08:49,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:08:49,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:08:49,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:08:49,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:08:49,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:08:49,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:08:49,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:08:49,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:08:49,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:08:49,499 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:08:49,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:08:49,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:08:49,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:08:49,516 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:08:49,516 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:08:49,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:08:49,517 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:08:49,517 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:08:49,517 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:08:49,517 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:08:49,517 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:08:49,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:08:49,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:08:49,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:08:49,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:08:49,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:08:49,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:08:49,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:08:49,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:08:49,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:08:49,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:08:49,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:08:49,521 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:08:49,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:08:49,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:08:49,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:08:49,522 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:08:49,522 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:08:49,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:08:49,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:08:49,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:08:49,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:08:49,607 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:08:49,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-09-10 10:08:49,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c0a871c/cc3e7b9708e64231bd38958b8eb14a00/FLAG0fd3bd6db [2018-09-10 10:08:50,152 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:08:50,152 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-09-10 10:08:50,160 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c0a871c/cc3e7b9708e64231bd38958b8eb14a00/FLAG0fd3bd6db [2018-09-10 10:08:50,177 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c0a871c/cc3e7b9708e64231bd38958b8eb14a00 [2018-09-10 10:08:50,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:08:50,191 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:08:50,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:08:50,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:08:50,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b06d656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50, skipping insertion in model container [2018-09-10 10:08:50,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,393 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:08:50,443 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,470 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:08:50,479 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50 WrapperNode [2018-09-10 10:08:50,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:08:50,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:08:50,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:08:50,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:08:50,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:08:50,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:08:50,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:08:50,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (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-09-10 10:08:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:08:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:08:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort [2018-09-10 10:08:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort [2018-09-10 10:08:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:08:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:08:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:08:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:08:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:08:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:08:51,311 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:08:51,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:51 BoogieIcfgContainer [2018-09-10 10:08:51,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:08:51,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:08:51,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:08:51,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:08:51,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:08:50" (1/3) ... [2018-09-10 10:08:51,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c4a6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:51, skipping insertion in model container [2018-09-10 10:08:51,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (2/3) ... [2018-09-10 10:08:51,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c4a6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:51, skipping insertion in model container [2018-09-10 10:08:51,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:51" (3/3) ... [2018-09-10 10:08:51,320 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-09-10 10:08:51,330 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:08:51,338 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:08:51,389 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:08:51,390 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:08:51,391 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:08:51,391 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:08:51,391 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:08:51,391 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:08:51,391 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:08:51,391 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:08:51,392 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:08:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-09-10 10:08:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-10 10:08:51,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,422 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1318846397, now seen corresponding path program 1 times [2018-09-10 10:08:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,498 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:51,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:08:51,584 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:08:51,601 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:08:51,601 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:08:51,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-09-10 10:08:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,627 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-09-10 10:08:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:08:51,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-10 10:08:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,636 INFO L225 Difference]: With dead ends: 63 [2018-09-10 10:08:51,636 INFO L226 Difference]: Without dead ends: 32 [2018-09-10 10:08:51,640 INFO L604 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-09-10 10:08:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-10 10:08:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-10 10:08:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-10 10:08:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-09-10 10:08:51,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-09-10 10:08:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,681 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-09-10 10:08:51,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:08:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-09-10 10:08:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:08:51,682 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,682 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1884353144, now seen corresponding path program 1 times [2018-09-10 10:08:51,683 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,685 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:51,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:08:51,760 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:08:51,762 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:08:51,762 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:08:51,763 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-09-10 10:08:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,853 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-10 10:08:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:08:51,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-09-10 10:08:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,854 INFO L225 Difference]: With dead ends: 58 [2018-09-10 10:08:51,855 INFO L226 Difference]: Without dead ends: 35 [2018-09-10 10:08:51,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:08:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-10 10:08:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-10 10:08:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-10 10:08:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-09-10 10:08:51,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-09-10 10:08:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,868 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-09-10 10:08:51,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:08:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-09-10 10:08:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-10 10:08:51,869 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,870 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash 362283247, now seen corresponding path program 1 times [2018-09-10 10:08:51,871 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,873 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:52,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:52,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:08:52,008 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:52,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:08:52,008 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:08:52,009 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:08:52,009 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-09-10 10:08:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:52,209 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-10 10:08:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:08:52,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-09-10 10:08:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:52,211 INFO L225 Difference]: With dead ends: 55 [2018-09-10 10:08:52,211 INFO L226 Difference]: Without dead ends: 42 [2018-09-10 10:08:52,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:08:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-10 10:08:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-09-10 10:08:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-10 10:08:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-09-10 10:08:52,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-09-10 10:08:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:52,223 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-09-10 10:08:52,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:08:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-09-10 10:08:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-10 10:08:52,226 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:52,226 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:52,226 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash -314923675, now seen corresponding path program 1 times [2018-09-10 10:08:52,227 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:52,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:52,228 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:52,558 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:52,558 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:52,577 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:52,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:52,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:52,872 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:08:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:52,891 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:52,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:08:53,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:53,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 4, 4] total 11 [2018-09-10 10:08:53,011 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:08:53,012 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:08:53,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:08:53,013 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-09-10 10:08:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:53,395 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-09-10 10:08:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:08:53,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-09-10 10:08:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:53,399 INFO L225 Difference]: With dead ends: 75 [2018-09-10 10:08:53,399 INFO L226 Difference]: Without dead ends: 50 [2018-09-10 10:08:53,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:08:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-10 10:08:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-09-10 10:08:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-10 10:08:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-09-10 10:08:53,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2018-09-10 10:08:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:53,409 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-09-10 10:08:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:08:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-09-10 10:08:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-10 10:08:53,410 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:53,410 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:53,411 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -885797851, now seen corresponding path program 1 times [2018-09-10 10:08:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:53,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,413 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:08:53,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:53,633 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:53,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:53,652 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:53,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:53,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:54,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:54,062 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:08:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:54,078 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:08:54,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:08:54,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:54,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6] total 17 [2018-09-10 10:08:54,451 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:54,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:08:54,452 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:08:54,452 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:08:54,452 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-09-10 10:08:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:54,707 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-09-10 10:08:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:08:54,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-09-10 10:08:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:54,709 INFO L225 Difference]: With dead ends: 78 [2018-09-10 10:08:54,709 INFO L226 Difference]: Without dead ends: 51 [2018-09-10 10:08:54,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:08:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-10 10:08:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-10 10:08:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-10 10:08:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-10 10:08:54,718 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2018-09-10 10:08:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:54,722 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-10 10:08:54,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:08:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-10 10:08:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-10 10:08:54,724 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:54,724 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:54,724 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 362380114, now seen corresponding path program 2 times [2018-09-10 10:08:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:54,726 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:08:54,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:54,929 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:54,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:54,939 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:54,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:54,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:54,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:08:55,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:08:55,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:55,161 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:08:55,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:55,179 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:55,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:55,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:08:55,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:08:55,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:55,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 7] total 20 [2018-09-10 10:08:55,630 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:55,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 10:08:55,631 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 10:08:55,631 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:08:55,631 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-09-10 10:08:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:56,071 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-09-10 10:08:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 10:08:56,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-09-10 10:08:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:56,072 INFO L225 Difference]: With dead ends: 99 [2018-09-10 10:08:56,073 INFO L226 Difference]: Without dead ends: 66 [2018-09-10 10:08:56,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-10 10:08:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-10 10:08:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-09-10 10:08:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-10 10:08:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-09-10 10:08:56,083 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-09-10 10:08:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:56,083 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-09-10 10:08:56,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 10:08:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-09-10 10:08:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-10 10:08:56,085 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:56,086 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:56,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1400725330, now seen corresponding path program 3 times [2018-09-10 10:08:56,087 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:56,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:08:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:56,088 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-10 10:08:56,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:56,230 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:08:56,238 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:08:56,259 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-10 10:08:56,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:56,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:56,291 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 6 treesize of output 5 [2018-09-10 10:08:56,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:56,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:08:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-10 10:08:56,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-10 10:08:56,877 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:08:56,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 19 [2018-09-10 10:08:56,877 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:56,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:08:56,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:08:56,878 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:08:56,879 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 8 states. [2018-09-10 10:08:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:57,074 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-09-10 10:08:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:08:57,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-10 10:08:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:57,076 INFO L225 Difference]: With dead ends: 67 [2018-09-10 10:08:57,076 INFO L226 Difference]: Without dead ends: 65 [2018-09-10 10:08:57,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-09-10 10:08:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-10 10:08:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-10 10:08:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-10 10:08:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-09-10 10:08:57,088 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-09-10 10:08:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:57,088 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-09-10 10:08:57,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:08:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-09-10 10:08:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-10 10:08:57,090 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:57,090 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:57,090 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash 389910769, now seen corresponding path program 1 times [2018-09-10 10:08:57,091 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:57,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:08:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:57,092 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-10 10:08:57,186 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:57,186 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:57,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:57,195 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:57,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-10 10:08:57,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-10 10:08:57,800 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:57,801 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:08:57,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:57,816 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:57,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-10 10:08:57,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-10 10:08:57,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:57,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 12 [2018-09-10 10:08:57,952 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:57,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 10:08:57,953 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 10:08:57,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:08:57,953 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 12 states. [2018-09-10 10:08:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:58,300 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-09-10 10:08:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 10:08:58,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-09-10 10:08:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:58,305 INFO L225 Difference]: With dead ends: 134 [2018-09-10 10:08:58,305 INFO L226 Difference]: Without dead ends: 90 [2018-09-10 10:08:58,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:08:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-10 10:08:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-09-10 10:08:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-10 10:08:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-09-10 10:08:58,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 61 [2018-09-10 10:08:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:58,325 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-09-10 10:08:58,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 10:08:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-09-10 10:08:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-10 10:08:58,326 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:58,327 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:58,327 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 962118901, now seen corresponding path program 2 times [2018-09-10 10:08:58,327 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:58,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:58,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:58,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:58,329 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-10 10:08:58,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:58,905 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:08:58,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:58,916 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:58,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:58,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:58,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-10 10:08:59,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 10:08:59,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:59,292 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:08:59,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:59,309 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:59,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:59,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:59,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-10 10:08:59,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 10:08:59,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:59,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8] total 18 [2018-09-10 10:08:59,608 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:59,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:08:59,609 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:08:59,609 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:08:59,610 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 13 states. [2018-09-10 10:08:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:59,926 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-09-10 10:08:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:08:59,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-09-10 10:08:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:59,933 INFO L225 Difference]: With dead ends: 133 [2018-09-10 10:08:59,933 INFO L226 Difference]: Without dead ends: 89 [2018-09-10 10:08:59,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-09-10 10:08:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-10 10:08:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-09-10 10:08:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-10 10:08:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-09-10 10:08:59,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 74 [2018-09-10 10:08:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:59,946 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-09-10 10:08:59,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:08:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-09-10 10:08:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-10 10:08:59,948 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:59,948 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:59,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -341375796, now seen corresponding path program 3 times [2018-09-10 10:08:59,949 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:59,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:08:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:59,950 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 10:09:00,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:00,184 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:09:00,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:09:00,193 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:09:00,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-10 10:09:00,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:00,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:00,231 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 6 treesize of output 5 [2018-09-10 10:09:00,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:00,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:00,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-10 10:09:00,325 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:00,327 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 16 treesize of output 21 [2018-09-10 10:09:00,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:00,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:00,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-10 10:09:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-09-10 10:09:00,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-10 10:09:00,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:00,956 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:09:00,973 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:09:01,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-10 10:09:01,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:01,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:01,079 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 6 treesize of output 5 [2018-09-10 10:09:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:01,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:01,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-10 10:09:01,092 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:01,093 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 16 treesize of output 21 [2018-09-10 10:09:01,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:01,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:01,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-10 10:09:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-10 10:09:01,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-10 10:09:01,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:01,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11, 11, 11] total 26 [2018-09-10 10:09:01,225 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:01,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-10 10:09:01,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-10 10:09:01,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-09-10 10:09:01,226 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-09-10 10:09:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:02,534 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-09-10 10:09:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-10 10:09:02,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-09-10 10:09:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:02,538 INFO L225 Difference]: With dead ends: 154 [2018-09-10 10:09:02,538 INFO L226 Difference]: Without dead ends: 110 [2018-09-10 10:09:02,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-09-10 10:09:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-10 10:09:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-09-10 10:09:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-10 10:09:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-09-10 10:09:02,554 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 78 [2018-09-10 10:09:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:02,554 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-09-10 10:09:02,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-10 10:09:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-09-10 10:09:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-10 10:09:02,556 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:02,556 INFO L376 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:02,556 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash 109404623, now seen corresponding path program 4 times [2018-09-10 10:09:02,557 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:02,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:02,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:02,558 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 4 proven. 98 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-09-10 10:09:02,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:02,716 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:09:02,732 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:09:02,764 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:09:02,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:02,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-10 10:09:02,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-10 10:09:03,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:03,128 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:09:03,146 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:09:03,207 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:09:03,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:03,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-10 10:09:03,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-10 10:09:03,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:03,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9, 8, 9] total 20 [2018-09-10 10:09:03,375 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:03,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 10:09:03,376 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 10:09:03,376 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:09:03,376 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-09-10 10:09:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:03,840 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-09-10 10:09:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:09:03,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-09-10 10:09:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:03,842 INFO L225 Difference]: With dead ends: 181 [2018-09-10 10:09:03,843 INFO L226 Difference]: Without dead ends: 115 [2018-09-10 10:09:03,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 382 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-09-10 10:09:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-10 10:09:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-09-10 10:09:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-10 10:09:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-09-10 10:09:03,860 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 100 [2018-09-10 10:09:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:03,861 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-09-10 10:09:03,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 10:09:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-09-10 10:09:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-10 10:09:03,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:03,863 INFO L376 BasicCegarLoop]: trace histogram [11, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:03,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1770517222, now seen corresponding path program 5 times [2018-09-10 10:09:03,864 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:03,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:03,865 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 102 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-10 10:09:04,032 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:04,032 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:04,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:09:04,046 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:04,071 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-10 10:09:04,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:04,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:04,310 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,312 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,314 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,320 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 101 [2018-09-10 10:09:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,401 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2018-09-10 10:09:04,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:04,775 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,777 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,778 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,779 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 71 [2018-09-10 10:09:04,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:04,993 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,994 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,995 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:04,996 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 70 [2018-09-10 10:09:05,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:05,143 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-09-10 10:09:05,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:05,314 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,317 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,319 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,320 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,323 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 70 [2018-09-10 10:09:05,343 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:05,438 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,441 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,444 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,447 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:05,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 61 [2018-09-10 10:09:05,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:05,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:09:05,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-09-10 10:09:05,699 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:36, output treesize:62 [2018-09-10 10:09:06,327 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,330 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,333 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,343 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,345 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,347 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,350 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:06,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 133 [2018-09-10 10:09:06,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2018-09-10 10:09:06,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:06,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:13 [2018-09-10 10:09:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 111 proven. 55 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-10 10:09:06,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:07,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,901 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,906 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,908 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,909 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,911 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:07,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 100 [2018-09-10 10:09:08,043 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-09-10 10:09:08,047 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,054 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,057 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,058 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,058 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,058 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,059 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,060 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,061 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,065 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,066 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,068 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,069 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,069 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,070 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,072 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 132 [2018-09-10 10:09:08,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,081 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,084 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,086 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,087 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,087 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,088 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,092 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,093 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,093 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:08,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 99 [2018-09-10 10:09:08,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:08,116 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,118 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,119 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,124 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,125 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,127 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:08,127 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:08,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:09:08,195 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:29 [2018-09-10 10:09:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-10 10:09:08,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:08,368 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:08,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:09:08,384 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:08,484 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-10 10:09:08,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:08,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:08,515 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,519 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,527 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,536 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 98 [2018-09-10 10:09:08,635 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:08,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 75 [2018-09-10 10:09:08,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:09,012 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,012 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,013 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,017 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-09-10 10:09:09,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:09,197 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,198 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,199 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,201 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 68 [2018-09-10 10:09:09,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:09,522 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,524 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,527 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,530 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 57 [2018-09-10 10:09:09,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:09,660 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,662 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,663 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,667 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 71 [2018-09-10 10:09:09,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:09,852 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,853 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,854 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-09-10 10:09:09,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:09,939 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,941 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,942 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,946 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:09,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 73 [2018-09-10 10:09:09,967 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:10,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, 10 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-10 10:09:10,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-09-10 10:09:10,146 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:33, output treesize:77 [2018-09-10 10:09:11,734 WARN L175 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-10 10:09:12,383 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-09-10 10:09:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-10 10:09:12,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:16,407 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,408 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,409 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,410 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,411 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,413 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,417 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 100 [2018-09-10 10:09:16,544 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-09-10 10:09:16,567 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,584 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,617 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:16,629 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,633 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,637 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,637 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,638 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,638 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,639 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,639 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,640 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,641 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:16,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,644 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,645 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,645 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 132 [2018-09-10 10:09:16,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,667 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,692 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,708 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,730 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,738 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,757 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,762 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,763 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,767 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:16,770 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-09-10 10:09:16,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 99 [2018-09-10 10:09:16,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-10 10:09:16,794 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,795 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,797 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,797 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,802 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,802 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,808 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:09:16,809 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:16,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:09:16,874 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:29 [2018-09-10 10:09:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-10 10:09:16,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:16,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19, 19, 19] total 52 [2018-09-10 10:09:16,913 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:16,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-10 10:09:16,913 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-10 10:09:16,914 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2018-09-10 10:09:16,914 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 26 states. [2018-09-10 10:09:20,795 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 27 [2018-09-10 10:09:21,970 WARN L175 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 29 [2018-09-10 10:09:22,350 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2018-09-10 10:09:23,477 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-09-10 10:09:24,178 WARN L175 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-09-10 10:09:26,336 WARN L175 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 37 [2018-09-10 10:09:26,717 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-09-10 10:09:27,438 WARN L175 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2018-09-10 10:09:30,072 WARN L175 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-09-10 10:09:30,425 WARN L175 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2018-09-10 10:09:30,815 WARN L175 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-09-10 10:09:31,036 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-09-10 10:09:31,306 WARN L175 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-09-10 10:09:31,641 WARN L175 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-09-10 10:09:33,134 WARN L175 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2018-09-10 10:09:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:33,382 INFO L93 Difference]: Finished difference Result 462 states and 561 transitions. [2018-09-10 10:09:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-10 10:09:33,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-09-10 10:09:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:33,386 INFO L225 Difference]: With dead ends: 462 [2018-09-10 10:09:33,386 INFO L226 Difference]: Without dead ends: 396 [2018-09-10 10:09:33,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 446 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9787 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=4214, Invalid=26586, Unknown=0, NotChecked=0, Total=30800 [2018-09-10 10:09:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-09-10 10:09:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-09-10 10:09:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-10 10:09:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2018-09-10 10:09:33,422 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 104 [2018-09-10 10:09:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:33,422 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2018-09-10 10:09:33,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-10 10:09:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2018-09-10 10:09:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-10 10:09:33,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:33,425 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:33,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 136803491, now seen corresponding path program 1 times [2018-09-10 10:09:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:33,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:33,426 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 12 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-10 10:09:34,065 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:34,065 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:34,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:34,074 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:34,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:09:34,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:09:34,134 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:09:34,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:09:34,144 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 27 treesize of output 26 [2018-09-10 10:09:34,145 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:34,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:09:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-09-10 10:09:35,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-10 10:09:36,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:09:36,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [17, 13] total 38 [2018-09-10 10:09:36,406 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:36,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:09:36,407 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:09:36,408 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2018-09-10 10:09:36,408 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 13 states. [2018-09-10 10:09:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:37,702 INFO L93 Difference]: Finished difference Result 484 states and 598 transitions. [2018-09-10 10:09:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 10:09:37,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-09-10 10:09:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:37,706 INFO L225 Difference]: With dead ends: 484 [2018-09-10 10:09:37,706 INFO L226 Difference]: Without dead ends: 275 [2018-09-10 10:09:37,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2018-09-10 10:09:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-10 10:09:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 237. [2018-09-10 10:09:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-10 10:09:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2018-09-10 10:09:37,740 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 122 [2018-09-10 10:09:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:37,741 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2018-09-10 10:09:37,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:09:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2018-09-10 10:09:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-10 10:09:37,742 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:37,742 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:37,743 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash -921034587, now seen corresponding path program 2 times [2018-09-10 10:09:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:37,744 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 12 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-10 10:09:38,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:38,278 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:38,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:38,286 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:38,328 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:09:38,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:38,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:38,398 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 6 treesize of output 5 [2018-09-10 10:09:38,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:09:38,444 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:38,445 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 12 treesize of output 15 [2018-09-10 10:09:38,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:09:38,510 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 17 treesize of output 16 [2018-09-10 10:09:38,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:38,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-10 10:09:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 340 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-10 10:09:39,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:39,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-09-10 10:09:39,337 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:39,338 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-09-10 10:09:39,359 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:39,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:39,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:39,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-10 10:09:39,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:12 [2018-09-10 10:09:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-09-10 10:09:39,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:39,529 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:39,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:39,545 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:39,646 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:09:39,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:39,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:39,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:09:39,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:09:39,671 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:09:39,673 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:09:39,677 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 27 treesize of output 26 [2018-09-10 10:09:39,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:39,736 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:09:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 10:09:40,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-10 10:09:41,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:09:41,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 20, 15, 11] total 65 [2018-09-10 10:09:41,043 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:41,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 10:09:41,043 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 10:09:41,045 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=3792, Unknown=0, NotChecked=0, Total=4160 [2018-09-10 10:09:41,045 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 11 states. [2018-09-10 10:09:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:42,064 INFO L93 Difference]: Finished difference Result 484 states and 597 transitions. [2018-09-10 10:09:42,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 10:09:42,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2018-09-10 10:09:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:42,067 INFO L225 Difference]: With dead ends: 484 [2018-09-10 10:09:42,067 INFO L226 Difference]: Without dead ends: 271 [2018-09-10 10:09:42,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=455, Invalid=4657, Unknown=0, NotChecked=0, Total=5112 [2018-09-10 10:09:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-10 10:09:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 233. [2018-09-10 10:09:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-10 10:09:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-09-10 10:09:42,100 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 122 [2018-09-10 10:09:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-09-10 10:09:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 10:09:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-09-10 10:09:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-10 10:09:42,101 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:42,102 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:42,102 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2013286309, now seen corresponding path program 3 times [2018-09-10 10:09:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:42,103 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:42,674 WARN L175 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-09-10 10:09:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 198 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-09-10 10:09:43,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:43,178 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:09:43,186 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:09:43,216 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-10 10:09:43,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:43,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:43,221 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 6 treesize of output 5 [2018-09-10 10:09:43,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-10 10:09:43,269 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:43,271 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 16 treesize of output 21 [2018-09-10 10:09:43,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-10 10:09:43,316 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:43,317 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:43,317 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:43,318 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 25 treesize of output 44 [2018-09-10 10:09:43,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:43,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-10 10:09:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-10 10:09:43,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-10 10:09:43,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:43,905 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:43,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:09:43,921 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:09:44,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-10 10:09:44,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:44,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:44,114 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 6 treesize of output 5 [2018-09-10 10:09:44,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-10 10:09:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:44,122 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 16 treesize of output 21 [2018-09-10 10:09:44,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-10 10:09:44,138 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:44,140 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:44,142 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:44,142 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 25 treesize of output 44 [2018-09-10 10:09:44,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:44,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-10 10:09:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-10 10:09:44,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-10 10:09:44,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:44,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 13] total 34 [2018-09-10 10:09:44,281 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:44,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-10 10:09:44,281 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-10 10:09:44,282 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-09-10 10:09:44,282 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 25 states. [2018-09-10 10:09:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:45,928 INFO L93 Difference]: Finished difference Result 494 states and 606 transitions. [2018-09-10 10:09:45,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-10 10:09:45,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2018-09-10 10:09:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:45,931 INFO L225 Difference]: With dead ends: 494 [2018-09-10 10:09:45,931 INFO L226 Difference]: Without dead ends: 313 [2018-09-10 10:09:45,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=376, Invalid=2380, Unknown=0, NotChecked=0, Total=2756 [2018-09-10 10:09:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-10 10:09:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 238. [2018-09-10 10:09:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-10 10:09:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-09-10 10:09:45,966 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 122 [2018-09-10 10:09:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:45,966 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-09-10 10:09:45,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-10 10:09:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-09-10 10:09:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:09:45,968 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:45,968 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:45,968 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1161798588, now seen corresponding path program 4 times [2018-09-10 10:09:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:45,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:45,970 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:46,214 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:09:46,537 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-09-10 10:09:46,781 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-09-10 10:09:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 190 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-09-10 10:09:47,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:47,624 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:09:47,632 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:09:47,671 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:09:47,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:47,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:47,677 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:09:47,679 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:09:47,685 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:09:47,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:09:47,693 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 27 treesize of output 26 [2018-09-10 10:09:47,694 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:47,757 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:09:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-09-10 10:09:48,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-10 10:09:49,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:49,071 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:49,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:09:49,087 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:09:49,175 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:09:49,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:49,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:49,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:09:49,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:09:49,188 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:09:49,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:09:49,205 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 27 treesize of output 26 [2018-09-10 10:09:49,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:49,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:09:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-09-10 10:09:49,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-10 10:09:49,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:49,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12, 12, 12] total 32 [2018-09-10 10:09:49,668 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:49,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-10 10:09:49,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-10 10:09:49,670 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-09-10 10:09:49,671 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 23 states. [2018-09-10 10:09:50,438 WARN L175 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2018-09-10 10:09:50,636 WARN L175 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2018-09-10 10:09:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:52,543 INFO L93 Difference]: Finished difference Result 588 states and 726 transitions. [2018-09-10 10:09:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-10 10:09:52,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-09-10 10:09:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:52,547 INFO L225 Difference]: With dead ends: 588 [2018-09-10 10:09:52,547 INFO L226 Difference]: Without dead ends: 380 [2018-09-10 10:09:52,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 502 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-09-10 10:09:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-10 10:09:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 248. [2018-09-10 10:09:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-10 10:09:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 295 transitions. [2018-09-10 10:09:52,590 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 295 transitions. Word has length 130 [2018-09-10 10:09:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:52,591 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 295 transitions. [2018-09-10 10:09:52,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-10 10:09:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 295 transitions. [2018-09-10 10:09:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:09:52,592 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:52,592 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:52,593 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1214970038, now seen corresponding path program 5 times [2018-09-10 10:09:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:52,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:52,594 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-09-10 10:09:53,078 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:53,078 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:09:53,085 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:53,126 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-10 10:09:53,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:53,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:53,282 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,283 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,284 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,285 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2018-09-10 10:09:53,296 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,296 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,297 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,300 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2018-09-10 10:09:53,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:13 [2018-09-10 10:09:53,445 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,446 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,447 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,451 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 58 [2018-09-10 10:09:53,459 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,460 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,461 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,466 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:09:53,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2018-09-10 10:09:53,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:09:53,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-09-10 10:09:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 225 proven. 83 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-09-10 10:09:53,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:59,471 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:59,471 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:59,481 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:09:59,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2018-09-10 10:10:00,324 WARN L175 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 203 [2018-09-10 10:10:00,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,330 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,331 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,335 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,337 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,341 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 127 [2018-09-10 10:10:00,382 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,385 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,386 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:00,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 166 [2018-09-10 10:10:00,457 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,460 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,461 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,461 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,462 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,462 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,467 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 87 [2018-09-10 10:10:00,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:00,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:00,611 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,612 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,613 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,614 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,614 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,615 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,616 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,616 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,621 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,622 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,623 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:00,624 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,630 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:00,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 169 [2018-09-10 10:10:01,035 WARN L175 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-09-10 10:10:01,038 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,039 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,044 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,047 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,049 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,050 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,055 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,057 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 126 [2018-09-10 10:10:01,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:01,207 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,208 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,210 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,213 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,214 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,215 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,215 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,216 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,219 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 132 [2018-09-10 10:10:01,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:01,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:01,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:01,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,363 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,363 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,364 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,368 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,374 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,385 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,389 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 141 [2018-09-10 10:10:01,436 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,437 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,437 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,439 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,440 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 129 [2018-09-10 10:10:01,529 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,530 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,530 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,538 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,539 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,539 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,549 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 125 [2018-09-10 10:10:01,715 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:01,789 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:01,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,938 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,947 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,950 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:01,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 141 [2018-09-10 10:10:02,212 WARN L175 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-09-10 10:10:02,215 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,216 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,218 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,218 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,219 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,219 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,220 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,222 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,226 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,230 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,231 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,231 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,232 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,241 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,243 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,248 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,253 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 171 [2018-09-10 10:10:02,306 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 20 xjuncts. [2018-09-10 10:10:02,560 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,561 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,561 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,562 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,562 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,563 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,565 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,568 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,569 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,575 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,575 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,576 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,585 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,587 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 162 [2018-09-10 10:10:02,652 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 18 xjuncts. [2018-09-10 10:10:02,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,869 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,870 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,889 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:02,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 135 [2018-09-10 10:10:02,908 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:02,999 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:03,082 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:03,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,100 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,101 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,103 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,105 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,107 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 157 [2018-09-10 10:10:03,238 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,239 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,246 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 147 [2018-09-10 10:10:03,560 WARN L175 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-09-10 10:10:03,564 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,565 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,567 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,569 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,569 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,571 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,592 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,594 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,603 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:03,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 136 [2018-09-10 10:10:03,632 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-09-10 10:10:03,764 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:04,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,172 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,172 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,173 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,175 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,190 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 123 [2018-09-10 10:10:04,452 WARN L175 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-09-10 10:10:04,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,460 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,460 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,462 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,468 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,469 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,470 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,470 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,477 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,479 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,484 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,488 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 152 [2018-09-10 10:10:04,537 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 20 xjuncts. [2018-09-10 10:10:04,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,871 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,872 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,873 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:04,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 148 [2018-09-10 10:10:04,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-10 10:10:04,951 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 25 xjuncts. [2018-09-10 10:10:05,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,635 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,636 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,636 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,638 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,640 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,648 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,652 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 113 [2018-09-10 10:10:05,669 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:05,729 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:05,877 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,877 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,881 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,881 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,882 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,889 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:05,891 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,893 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:05,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 140 [2018-09-10 10:10:06,268 WARN L175 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-09-10 10:10:06,271 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,272 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,276 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,277 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,277 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,278 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,279 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,281 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,282 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,291 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,292 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,297 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 142 [2018-09-10 10:10:06,321 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:06,431 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,432 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,434 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,435 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,435 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,437 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,438 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,439 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,439 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,440 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,454 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:06,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 144 [2018-09-10 10:10:06,493 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 12 xjuncts. [2018-09-10 10:10:06,582 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:06,696 INFO L267 ElimStorePlain]: Start of recursive call 16: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:07,292 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,293 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,299 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,299 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,300 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,304 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,312 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 124 [2018-09-10 10:10:07,357 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,359 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 111 [2018-09-10 10:10:07,653 WARN L175 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-09-10 10:10:07,656 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,658 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,658 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,660 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,661 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,663 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,665 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,666 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,667 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,674 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,682 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 115 [2018-09-10 10:10:07,710 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 6 xjuncts. [2018-09-10 10:10:07,916 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,919 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:07,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 83 [2018-09-10 10:10:07,951 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:08,059 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,065 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,067 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,069 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,190 INFO L303 Elim1Store]: Index analysis took 133 ms [2018-09-10 10:10:08,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 114 [2018-09-10 10:10:08,226 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 9 xjuncts. [2018-09-10 10:10:08,578 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:08,780 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,781 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,782 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,783 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,785 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,789 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 96 [2018-09-10 10:10:08,926 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-09-10 10:10:08,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,944 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,945 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,946 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,947 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,950 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,952 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:08,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 87 [2018-09-10 10:10:08,961 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:09,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,038 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,048 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,049 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,050 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,055 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,056 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,058 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,061 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 104 [2018-09-10 10:10:09,080 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 3 xjuncts. [2018-09-10 10:10:09,151 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:09,267 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,270 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,270 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,271 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,278 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 96 [2018-09-10 10:10:09,446 WARN L175 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-09-10 10:10:09,449 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,450 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,450 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,451 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,454 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 75 [2018-09-10 10:10:09,474 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:09,557 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,559 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,559 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,560 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,561 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,561 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,562 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,563 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,567 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 81 [2018-09-10 10:10:09,582 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:09,655 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,656 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,656 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:09,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-09-10 10:10:09,661 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:09,681 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:09,827 INFO L267 ElimStorePlain]: Start of recursive call 26: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:10,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,212 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,213 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,216 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,217 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,219 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,221 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,235 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,244 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 154 [2018-09-10 10:10:10,353 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,369 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:10,689 INFO L303 Elim1Store]: Index analysis took 373 ms [2018-09-10 10:10:10,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 133 [2018-09-10 10:10:11,369 WARN L175 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-09-10 10:10:11,372 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,373 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,373 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,376 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,377 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,381 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,385 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,391 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,396 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 131 [2018-09-10 10:10:11,434 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 6 xjuncts. [2018-09-10 10:10:11,567 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:11,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,976 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,976 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,977 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,983 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,991 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:11,993 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 126 [2018-09-10 10:10:12,217 WARN L175 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-09-10 10:10:12,221 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,222 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,222 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,223 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,223 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,224 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,226 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,226 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,232 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,237 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 96 [2018-09-10 10:10:12,239 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:12,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,317 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,317 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,318 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,319 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,324 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,325 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,325 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,332 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,334 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 126 [2018-09-10 10:10:12,369 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:12,488 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:12,915 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,916 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,919 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,920 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,920 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,941 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,943 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:12,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 136 [2018-09-10 10:10:13,189 WARN L175 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-09-10 10:10:13,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,193 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,193 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,194 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,194 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,201 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,201 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,202 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,202 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,209 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,216 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,219 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 140 [2018-09-10 10:10:13,244 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:13,393 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,397 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,400 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,400 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,401 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,402 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,403 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,406 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,411 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,420 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,422 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,433 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,436 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 176 [2018-09-10 10:10:13,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-10 10:10:13,528 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 40 xjuncts. [2018-09-10 10:10:13,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,871 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,873 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:13,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 167 [2018-09-10 10:10:13,945 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-10 10:10:13,969 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 36 xjuncts. [2018-09-10 10:10:14,231 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:14,698 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,698 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,700 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,705 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,707 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,722 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:14,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 138 [2018-09-10 10:10:15,126 WARN L175 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-09-10 10:10:15,129 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,132 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,133 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,133 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,134 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,134 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,146 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,150 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 108 [2018-09-10 10:10:15,169 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:15,337 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,337 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,338 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,340 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,341 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,343 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,344 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,346 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,347 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,347 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,348 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,354 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,356 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,361 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,364 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 140 [2018-09-10 10:10:15,397 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 12 xjuncts. [2018-09-10 10:10:15,622 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,623 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,627 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,628 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,628 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,630 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,633 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,635 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,639 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,640 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,651 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,656 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,662 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:15,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 176 [2018-09-10 10:10:15,706 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-10 10:10:15,761 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 72 xjuncts. [2018-09-10 10:10:16,238 INFO L267 ElimStorePlain]: Start of recursive call 48: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:16,338 INFO L267 ElimStorePlain]: Start of recursive call 38: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:16,675 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,678 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,678 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,680 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,682 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,683 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 59 treesize of output 152 [2018-09-10 10:10:16,815 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,817 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,817 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:16,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 129 [2018-09-10 10:10:17,008 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-09-10 10:10:17,010 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,011 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,011 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,012 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,012 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,013 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-09-10 10:10:17,021 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:17,079 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,080 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,080 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,081 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-09-10 10:10:17,103 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:17,158 INFO L267 ElimStorePlain]: Start of recursive call 53: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:17,960 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,962 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,962 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:17,975 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 119 [2018-09-10 10:10:18,170 WARN L175 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-09-10 10:10:18,173 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,175 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,176 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,176 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,177 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,178 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,178 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,179 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,189 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 121 [2018-09-10 10:10:18,216 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:18,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,309 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,309 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,320 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 120 [2018-09-10 10:10:18,356 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:18,433 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:18,660 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,665 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,666 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,666 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,667 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,667 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,668 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,671 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,679 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:18,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 155 [2018-09-10 10:10:19,067 WARN L175 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-09-10 10:10:19,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,073 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,073 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,074 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,074 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,075 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,076 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,076 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,079 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,080 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,086 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,087 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,087 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,090 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 149 [2018-09-10 10:10:19,123 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:19,353 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,354 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,354 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,355 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,355 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,356 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,356 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,357 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,359 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,360 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,361 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,362 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,363 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:19,364 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 114 [2018-09-10 10:10:19,366 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:19,505 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,506 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,508 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,508 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,509 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,510 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,511 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,513 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,515 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,523 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,524 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:19,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 153 [2018-09-10 10:10:19,575 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 12 xjuncts. [2018-09-10 10:10:19,867 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:20,422 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,423 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,423 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,424 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,425 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,425 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,428 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,428 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,429 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,438 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 143 [2018-09-10 10:10:20,667 WARN L175 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-09-10 10:10:20,671 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,671 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,672 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,673 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,673 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,674 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,675 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,675 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,676 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,677 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:20,678 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 95 [2018-09-10 10:10:20,680 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:20,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,775 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,777 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,778 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,778 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,779 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,780 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,780 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,781 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:20,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 129 [2018-09-10 10:10:20,804 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:20,921 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:22,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,252 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,253 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,255 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,257 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,259 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,277 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 69 treesize of output 138 [2018-09-10 10:10:22,691 WARN L175 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2018-09-10 10:10:22,696 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,697 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,698 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,698 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,700 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,706 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,709 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,711 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,720 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,724 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,731 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:22,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 178 [2018-09-10 10:10:22,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-10 10:10:22,832 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 48 xjuncts. [2018-09-10 10:10:23,494 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,496 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,496 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,497 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,499 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,501 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,503 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,506 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,508 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,510 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,520 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:23,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 185 [2018-09-10 10:10:23,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-09-10 10:10:23,796 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 158 xjuncts. [2018-09-10 10:10:25,209 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,210 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,210 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,213 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,215 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,217 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,220 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,235 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:25,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 179 [2018-09-10 10:10:25,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-09-10 10:10:25,466 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 192 xjuncts. [2018-09-10 10:10:27,327 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,327 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,331 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,331 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,332 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,332 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,334 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:27,343 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 117 [2018-09-10 10:10:27,355 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:27,560 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,561 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,562 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,562 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,563 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,565 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,567 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,568 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 100 [2018-09-10 10:10:27,593 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-09-10 10:10:27,720 INFO L267 ElimStorePlain]: Start of recursive call 66: 5 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-10 10:10:27,956 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,960 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,962 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:27,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 128 [2018-09-10 10:10:28,186 WARN L175 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-09-10 10:10:28,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,194 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,195 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,200 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,200 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,201 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,205 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,209 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,216 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 147 [2018-09-10 10:10:28,245 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 8 xjuncts. [2018-09-10 10:10:28,411 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,412 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,412 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,413 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,416 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,418 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,420 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,430 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 143 [2018-09-10 10:10:28,474 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 16 xjuncts. [2018-09-10 10:10:28,642 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:10:28,754 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, 18 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:28,854 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,855 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,856 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 63 [2018-09-10 10:10:28,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2018-09-10 10:10:28,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,891 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:10:28,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-09-10 10:10:28,897 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:28,899 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:28,911 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:29,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-10 10:10:29,072 INFO L202 ElimStorePlain]: Needed 77 recursive calls to eliminate 3 variables, input treesize:78, output treesize:41 [2018-09-10 10:10:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 231 proven. 82 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-10 10:10:29,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:29,211 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:10:29,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:10:29,227 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:10:29,509 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-10 10:10:29,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:29,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:29,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 17 [2018-09-10 10:10:29,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 18 [2018-09-10 10:10:29,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-10 10:10:29,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-09-10 10:10:29,557 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,558 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,558 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,560 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-09-10 10:10:29,569 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,570 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,571 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2018-09-10 10:10:29,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-09-10 10:10:29,617 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,618 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,619 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,623 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-09-10 10:10:29,629 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,630 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,631 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:29,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-09-10 10:10:29,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:29,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:13 [2018-09-10 10:10:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 225 proven. 82 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-09-10 10:10:29,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 234 proven. 79 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-10 10:10:30,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:30,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14, 14, 14] total 46 [2018-09-10 10:10:30,247 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-10 10:10:30,248 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-10 10:10:30,248 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1917, Unknown=2, NotChecked=0, Total=2070 [2018-09-10 10:10:30,248 INFO L87 Difference]: Start difference. First operand 248 states and 295 transitions. Second operand 25 states. [2018-09-10 10:10:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:37,435 INFO L93 Difference]: Finished difference Result 931 states and 1164 transitions. [2018-09-10 10:10:37,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-10 10:10:37,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 130 [2018-09-10 10:10:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:37,440 INFO L225 Difference]: With dead ends: 931 [2018-09-10 10:10:37,440 INFO L226 Difference]: Without dead ends: 742 [2018-09-10 10:10:37,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 492 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=948, Invalid=9556, Unknown=2, NotChecked=0, Total=10506 [2018-09-10 10:10:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-09-10 10:10:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 441. [2018-09-10 10:10:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-09-10 10:10:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 540 transitions. [2018-09-10 10:10:37,528 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 540 transitions. Word has length 130 [2018-09-10 10:10:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:37,528 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 540 transitions. [2018-09-10 10:10:37,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-10 10:10:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 540 transitions. [2018-09-10 10:10:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:10:37,529 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:37,530 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:37,530 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 851729354, now seen corresponding path program 6 times [2018-09-10 10:10:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:37,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:10:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:37,531 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:37,736 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 10:10:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 258 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-10 10:10:38,205 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:38,205 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:10:38,214 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-10 10:10:38,214 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-10 10:10:38,245 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-10 10:10:38,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:38,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:38,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:10:38,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:10:38,287 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:10:38,295 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:10:38,297 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 27 treesize of output 26 [2018-09-10 10:10:38,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:38,352 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:10:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-09-10 10:10:38,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-09-10 10:10:39,169 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:39,169 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:10:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-10 10:10:39,185 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-10 10:10:39,410 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-10 10:10:39,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:39,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:39,417 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:10:39,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:10:39,420 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:10:39,422 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:10:39,427 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 27 treesize of output 26 [2018-09-10 10:10:39,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:39,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:10:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-09-10 10:10:39,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-09-10 10:10:39,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:39,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9, 10, 9] total 27 [2018-09-10 10:10:39,893 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:39,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-10 10:10:39,894 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-10 10:10:39,894 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=608, Unknown=2, NotChecked=0, Total=702 [2018-09-10 10:10:39,894 INFO L87 Difference]: Start difference. First operand 441 states and 540 transitions. Second operand 21 states. [2018-09-10 10:10:40,664 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2018-09-10 10:10:41,334 WARN L175 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-09-10 10:10:41,556 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2018-09-10 10:10:42,236 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-09-10 10:10:42,428 WARN L175 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2018-09-10 10:10:43,167 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2018-09-10 10:10:43,562 WARN L175 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-09-10 10:10:44,272 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 29 [2018-09-10 10:10:44,802 WARN L175 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-09-10 10:10:45,594 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2018-09-10 10:10:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:45,832 INFO L93 Difference]: Finished difference Result 1108 states and 1368 transitions. [2018-09-10 10:10:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-10 10:10:45,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2018-09-10 10:10:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:45,837 INFO L225 Difference]: With dead ends: 1108 [2018-09-10 10:10:45,837 INFO L226 Difference]: Without dead ends: 733 [2018-09-10 10:10:45,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 504 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1062, Invalid=4034, Unknown=16, NotChecked=0, Total=5112 [2018-09-10 10:10:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-10 10:10:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 457. [2018-09-10 10:10:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-10 10:10:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 558 transitions. [2018-09-10 10:10:45,941 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 558 transitions. Word has length 130 [2018-09-10 10:10:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:45,941 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 558 transitions. [2018-09-10 10:10:45,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-10 10:10:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 558 transitions. [2018-09-10 10:10:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:10:45,943 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:45,943 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:45,943 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash 492680912, now seen corresponding path program 7 times [2018-09-10 10:10:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:45,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:10:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:45,945 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:46,211 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 10:10:46,520 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-09-10 10:10:46,642 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2018-09-10 10:10:46,765 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-09-10 10:10:46,894 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-09-10 10:10:47,022 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-09-10 10:10:47,410 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-09-10 10:10:47,847 WARN L175 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-09-10 10:10:48,035 WARN L175 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-09-10 10:10:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 296 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-10 10:10:48,277 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:48,277 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:10:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:48,284 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:10:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:48,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:48,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-10 10:10:48,359 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-10 10:10:48,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-09-10 10:10:48,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-09-10 10:10:48,370 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 27 treesize of output 26 [2018-09-10 10:10:48,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,387 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:48,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-10 10:10:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-09-10 10:10:49,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:50,027 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-09-10 10:10:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 98 proven. 202 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-10 10:10:52,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:52,281 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:10:52,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:52,296 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:10:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:52,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:52,533 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 6 treesize of output 5 [2018-09-10 10:10:52,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:52,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:52,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:10:52,653 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:52,654 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 12 treesize of output 15 [2018-09-10 10:10:52,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:52,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:52,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:10:53,372 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,373 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,374 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,374 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 17 treesize of output 28 [2018-09-10 10:10:53,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:53,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:10:53,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-10 10:10:53,547 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,548 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,548 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,549 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,550 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,551 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:10:53,552 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 22 treesize of output 45 [2018-09-10 10:10:53,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:53,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-10 10:10:53,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-10 10:10:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-10 10:10:54,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:55,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-09-10 10:10:55,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:55,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:55,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-10 10:10:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-10 10:10:55,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:55,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 16, 17, 12] total 76 [2018-09-10 10:10:55,645 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:55,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-10 10:10:55,646 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-10 10:10:55,646 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=5252, Unknown=10, NotChecked=0, Total=5700 [2018-09-10 10:10:55,647 INFO L87 Difference]: Start difference. First operand 457 states and 558 transitions. Second operand 40 states. [2018-09-10 10:10:56,641 WARN L175 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 32 [2018-09-10 10:10:56,879 WARN L175 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2018-09-10 10:10:58,617 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2018-09-10 10:10:58,905 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-09-10 10:10:59,251 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-09-10 10:10:59,672 WARN L175 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2018-09-10 10:10:59,926 WARN L175 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2018-09-10 10:11:00,186 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2018-09-10 10:11:00,523 WARN L175 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2018-09-10 10:11:01,406 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2018-09-10 10:11:01,765 WARN L175 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 31 [2018-09-10 10:11:02,666 WARN L175 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 36 [2018-09-10 10:11:03,050 WARN L175 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-09-10 10:11:03,290 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2018-09-10 10:11:03,614 WARN L175 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 34 [2018-09-10 10:11:03,893 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 34 [2018-09-10 10:11:04,123 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 38 [2018-09-10 10:11:04,592 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2018-09-10 10:11:04,850 WARN L175 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2018-09-10 10:11:05,140 WARN L175 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-09-10 10:11:05,724 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-09-10 10:11:06,448 WARN L175 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-09-10 10:11:07,027 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2018-09-10 10:11:07,500 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2018-09-10 10:11:07,705 WARN L175 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 36 [2018-09-10 10:11:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:11:08,174 INFO L93 Difference]: Finished difference Result 1243 states and 1543 transitions. [2018-09-10 10:11:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-10 10:11:08,175 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 130 [2018-09-10 10:11:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:11:08,179 INFO L225 Difference]: With dead ends: 1243 [2018-09-10 10:11:08,179 INFO L226 Difference]: Without dead ends: 843 [2018-09-10 10:11:08,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 460 SyntacticMatches, 8 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6045 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=2503, Invalid=16917, Unknown=40, NotChecked=0, Total=19460 [2018-09-10 10:11:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-09-10 10:11:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 566. [2018-09-10 10:11:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-09-10 10:11:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 689 transitions. [2018-09-10 10:11:08,291 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 689 transitions. Word has length 130 [2018-09-10 10:11:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:11:08,291 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 689 transitions. [2018-09-10 10:11:08,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-10 10:11:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 689 transitions. [2018-09-10 10:11:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:11:08,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:11:08,293 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:11:08,293 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:11:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1400509780, now seen corresponding path program 1 times [2018-09-10 10:11:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:11:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:08,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:11:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:08,294 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:11:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:11:08,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:08,830 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:11:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:11:08,852 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:11:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:08,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:09,125 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 6 treesize of output 5 [2018-09-10 10:11:09,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:11:09,170 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:09,171 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 12 treesize of output 15 [2018-09-10 10:11:09,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:11:09,222 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:09,224 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:09,224 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 17 treesize of output 24 [2018-09-10 10:11:09,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-09-10 10:11:09,296 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 22 treesize of output 21 [2018-09-10 10:11:09,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:09,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-09-10 10:11:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 339 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 10:11:09,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:09,993 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-09-10 10:11:09,997 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:09,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-09-10 10:11:10,000 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,003 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,004 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,004 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 56 [2018-09-10 10:11:10,031 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,032 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,033 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,034 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,034 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:10,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-09-10 10:11:10,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:29, output treesize:17 [2018-09-10 10:11:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 24 proven. 43 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-10 10:11:10,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:10,191 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:11:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:11:10,206 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:11:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:10,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:10,326 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 6 treesize of output 5 [2018-09-10 10:11:10,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:11:10,373 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,374 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 12 treesize of output 15 [2018-09-10 10:11:10,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:11:10,456 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,457 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,459 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,459 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 17 treesize of output 28 [2018-09-10 10:11:10,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:11:10,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-10 10:11:10,570 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,571 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,572 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,573 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,574 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,575 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:10,576 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 22 treesize of output 45 [2018-09-10 10:11:10,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-10 10:11:10,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-10 10:11:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-10 10:11:10,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:10,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-09-10 10:11:10,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:10,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-10 10:11:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-10 10:11:11,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:11:11,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 17, 17, 12] total 57 [2018-09-10 10:11:11,012 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:11:11,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-10 10:11:11,012 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-10 10:11:11,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=2779, Unknown=0, NotChecked=0, Total=3192 [2018-09-10 10:11:11,013 INFO L87 Difference]: Start difference. First operand 566 states and 689 transitions. Second operand 38 states. [2018-09-10 10:11:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:11:13,536 INFO L93 Difference]: Finished difference Result 958 states and 1187 transitions. [2018-09-10 10:11:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-10 10:11:13,536 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 130 [2018-09-10 10:11:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:11:13,541 INFO L225 Difference]: With dead ends: 958 [2018-09-10 10:11:13,541 INFO L226 Difference]: Without dead ends: 956 [2018-09-10 10:11:13,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 481 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=946, Invalid=6886, Unknown=0, NotChecked=0, Total=7832 [2018-09-10 10:11:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-09-10 10:11:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 574. [2018-09-10 10:11:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-09-10 10:11:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 697 transitions. [2018-09-10 10:11:13,679 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 697 transitions. Word has length 130 [2018-09-10 10:11:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:11:13,680 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 697 transitions. [2018-09-10 10:11:13,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-10 10:11:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 697 transitions. [2018-09-10 10:11:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-10 10:11:13,682 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:11:13,682 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:11:13,682 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:11:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 715990259, now seen corresponding path program 2 times [2018-09-10 10:11:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:11:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:11:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:13,684 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:11:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:14,168 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:11:14,448 WARN L175 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2018-09-10 10:11:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 112 proven. 57 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-09-10 10:11:15,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:15,292 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:11:15,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:11:15,299 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:11:15,340 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:11:15,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:11:15,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:15,760 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 6 treesize of output 5 [2018-09-10 10:11:15,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:15,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:15,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:11:16,169 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,169 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 12 treesize of output 15 [2018-09-10 10:11:16,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:11:16,224 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,225 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,225 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 17 treesize of output 24 [2018-09-10 10:11:16,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-09-10 10:11:16,291 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,291 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,292 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,293 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,294 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:16,295 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 26 treesize of output 51 [2018-09-10 10:11:16,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2018-09-10 10:11:16,384 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 27 treesize of output 26 [2018-09-10 10:11:16,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:16,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-09-10 10:11:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 8 proven. 396 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:11:16,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-09-10 10:11:17,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2018-09-10 10:11:17,496 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,496 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,497 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2018-09-10 10:11:17,500 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,500 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,501 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,501 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,501 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,502 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 85 [2018-09-10 10:11:17,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:11:17,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2018-09-10 10:11:17,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:36, output treesize:22 [2018-09-10 10:11:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-10 10:11:17,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:17,693 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:11:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:11:17,708 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:11:17,833 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:11:17,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:11:17,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:17,842 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 6 treesize of output 5 [2018-09-10 10:11:17,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-10 10:11:17,915 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:17,915 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 12 treesize of output 15 [2018-09-10 10:11:17,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:17,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-10 10:11:18,002 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,003 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,005 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,005 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 17 treesize of output 28 [2018-09-10 10:11:18,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:18,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:11:18,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-10 10:11:18,127 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,128 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,128 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,129 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,130 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,131 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,132 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 22 treesize of output 45 [2018-09-10 10:11:18,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:18,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-10 10:11:18,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-09-10 10:11:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,291 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,293 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,294 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,295 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,297 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,298 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,300 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,301 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,302 INFO L700 Elim1Store]: detected not equals via solver [2018-09-10 10:11:18,303 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 27 treesize of output 66 [2018-09-10 10:11:18,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:18,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-10 10:11:18,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-10 10:11:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-10 10:11:19,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:20,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-09-10 10:11:20,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:20,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:20,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-10 10:11:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-09-10 10:11:20,674 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:11:20,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 19, 20, 13] total 81 [2018-09-10 10:11:20,674 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:11:20,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-10 10:11:20,675 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-10 10:11:20,676 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=5630, Unknown=3, NotChecked=0, Total=6480 [2018-09-10 10:11:20,676 INFO L87 Difference]: Start difference. First operand 574 states and 697 transitions. Second operand 48 states. [2018-09-10 10:11:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:11:24,850 INFO L93 Difference]: Finished difference Result 1728 states and 2153 transitions. [2018-09-10 10:11:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-10 10:11:24,851 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 138 [2018-09-10 10:11:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:11:24,851 INFO L225 Difference]: With dead ends: 1728 [2018-09-10 10:11:24,851 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:11:24,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 492 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5604 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1519, Invalid=12998, Unknown=3, NotChecked=0, Total=14520 [2018-09-10 10:11:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:11:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:11:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:11:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:11:24,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-09-10 10:11:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:11:24,857 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:11:24,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-10 10:11:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:11:24,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:11:24,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:11:24,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:26,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:27,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:27,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:27,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:28,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:29,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:30,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:31,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:31,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:31,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:31,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:31,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:32,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:32,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:32,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:33,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:33,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:34,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:35,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:35,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:35,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:36,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:36,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:36,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,168 WARN L175 SmtUtils]: Spent 13.28 s on a formula simplification. DAG size of input: 1475 DAG size of output: 1327 [2018-09-10 10:11:38,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:11:38,665 WARN L175 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 298 [2018-09-10 10:12:30,306 WARN L175 SmtUtils]: Spent 51.51 s on a formula simplification. DAG size of input: 1333 DAG size of output: 57 [2018-09-10 10:12:30,461 WARN L175 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2018-09-10 10:12:31,164 WARN L175 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 78 [2018-09-10 10:12:31,685 WARN L175 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2018-09-10 10:12:32,387 WARN L175 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 65 [2018-09-10 10:12:32,499 WARN L175 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 1 [2018-09-10 10:12:34,861 WARN L175 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 310 DAG size of output: 42 [2018-09-10 10:12:34,923 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:12:34,923 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 21 22) no Hoare annotation was computed. [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point L21-3(lines 21 22) no Hoare annotation was computed. [2018-09-10 10:12:34,924 INFO L422 ceAbstractionStarter]: At program point L21-4(lines 21 22) the Hoare annotation is: (let ((.cse0 (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 1))) (.cse2 (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) (.cse3 (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 2) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0))) (or (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (let ((.cse1 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 1))) (and .cse0 (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 .cse1) (<= .cse1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0))) (and .cse2 (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 3) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0)) (and (< (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (- 1))) (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (- 2)))) .cse0 .cse3 .cse2) (and .cse3 (and (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 2)) (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 3))) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)))) [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point L21-5(lines 21 22) no Hoare annotation was computed. [2018-09-10 10:12:34,924 INFO L426 ceAbstractionStarter]: For program point L19-3(lines 19 26) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L422 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0))) (or (and (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 1) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0) .cse0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (and (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 1)) .cse0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)))) [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point L19-5(lines 15 27) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSortEXIT(lines 15 27) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSortENTRY(lines 15 27) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 4) 0) (= 0 (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 2)) (= 0 (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 3)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 0) 0) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 1) 0)) [2018-09-10 10:12:34,925 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 33 34) no Hoare annotation was computed. [2018-09-10 10:12:34,925 INFO L426 ceAbstractionStarter]: For program point L33-3(lines 33 34) no Hoare annotation was computed. [2018-09-10 10:12:34,926 INFO L422 ceAbstractionStarter]: At program point L33-4(lines 33 34) the Hoare annotation is: (let ((.cse1 (+ main_~i~1 1)) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)) (.cse0 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4)))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (and .cse0 (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse1) .cse1) .cse2 (= main_~i~1 1) .cse3) (and (= main_~i~1 0) (let ((.cse4 (+ main_~i~1 2))) (= .cse4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse4))) .cse0 .cse2 .cse3 (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (let ((.cse5 (+ v_main_~i~1_87 1))) (= .cse5 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse5))) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87))))) (and .cse0 (= main_~i~1 2) .cse2 .cse3) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (and (exists ((v_main_~i~1_159 Int)) (and (<= 0 v_main_~i~1_159) (let ((.cse6 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse6) .cse6)) (<= v_main_~i~1_159 (+ main_~i~1 1)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse7 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse7) .cse7)))) (<= .cse1 0) .cse0 .cse2 .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (and (= main_~i~1 4) .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (and .cse3 (= main_~i~1 3) .cse0))) [2018-09-10 10:12:34,926 INFO L422 ceAbstractionStarter]: At program point L33-5(lines 33 34) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (and (or (<= (+ main_~i~1 1) 0) (= main_~i~1 0)) (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4)) (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse0 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse0) .cse0)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse1 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse1) .cse1)))) (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (let ((.cse2 (+ v_main_~i~1_87 1))) (= .cse2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse2))) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87))))) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-09-10 10:12:34,926 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 29 41) no Hoare annotation was computed. [2018-09-10 10:12:34,926 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-09-10 10:12:34,926 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-10 10:12:34,926 INFO L422 ceAbstractionStarter]: At program point L38-3(lines 38 39) the Hoare annotation is: (let ((.cse1 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4))) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3)))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (and (exists ((v_main_~i~1_87 Int)) (and (let ((.cse0 (+ v_main_~i~1_87 1))) (= .cse0 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse0))) (<= v_main_~i~1_87 0) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87)))) (= main_~i~1 0)) (= 2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 2)) .cse1 .cse2) (and .cse1 .cse2 (and (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse3 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse3) .cse3)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse4 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse4) .cse4)))) (<= 1 main_~i~1))) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)))) [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point L38-4(lines 29 41) no Hoare annotation was computed. [2018-09-10 10:12:34,927 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 29 41) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-09-10 10:12:34,927 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse4 (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse6 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse6) .cse6)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse7 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse7) .cse7)))))) (let ((.cse0 (= 2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 2))) (.cse1 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4))) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3))) (.cse3 (and .cse4 (and (<= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (<= 1 main_~i~1))))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (and (= main_~i~1 1) (= 1 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 1)) .cse0 (= 0 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 0)) .cse1 .cse2) (and (= main_~i~1 4) .cse1 .cse2 .cse3) (and .cse1 .cse2 (and (= main_~i~1 2) .cse4)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (and (exists ((v_main_~i~1_87 Int)) (and (let ((.cse5 (+ v_main_~i~1_87 1))) (= .cse5 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse5))) (<= v_main_~i~1_87 0) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87)))) (= main_~i~1 0)) .cse0 .cse1 .cse2) (and (= main_~i~1 3) .cse1 .cse2 .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0))))) [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 38 39) no Hoare annotation was computed. [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-10 10:12:34,927 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-10 10:12:34,927 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-10 10:12:34,928 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:12:34,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:12:34 BoogieIcfgContainer [2018-09-10 10:12:34,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:12:34,971 INFO L168 Benchmark]: Toolchain (without parser) took 224782.36 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-10 10:12:34,972 INFO L168 Benchmark]: CDTParser took 0.22 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-09-10 10:12:34,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.35 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-09-10 10:12:34,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.09 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-09-10 10:12:34,972 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 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-09-10 10:12:34,973 INFO L168 Benchmark]: RCFGBuilder took 760.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:12:34,973 INFO L168 Benchmark]: TraceAbstraction took 223657.07 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -767.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-10 10:12:34,975 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.22 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 303.35 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 27.09 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 27.46 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 760.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223657.07 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -767.8 MB). Peak memory consumption was 1.6 GB. 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_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,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: 21]: Loop Invariant Derived loop invariant: (((((((((5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n || ((i == rh + 1 && i == lh + 1) && lh + 1 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || (i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n && lh + 3 <= i)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + -1] < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + -2] && i == rh + 1) && lh + 2 <= i) && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || (lh + 2 <= i && i <= rh + 2 && rh <= 3)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) - InvariantResult [Line: 33]: Loop Invariant [2018-09-10 10:12:34,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] Derived loop invariant: (((((((((((!(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) || ((((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + 1] == i + 1) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && i == 1) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || (((((i == 0 && i + 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + 2]) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) && (\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 <= i + 1 && v_main_~i~1_87 + 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87 + 1]) && 0 <= v_main_~i~1_87) && v_main_~i~1_87 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87]))) || (((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && i == 2) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || (((((\exists v_main_~i~1_159 : int :: (((0 <= v_main_~i~1_159 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && v_main_~i~1_159 <= i + 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159] == v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 1] == v_main_~i~1_159 + 1) && i + 1 <= 0) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || (i == 4 && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || ((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array && i == 3) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) - InvariantResult [Line: 38]: Loop Invariant [2018-09-10 10:12:34,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:34,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:35,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:35,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:35,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-10 10:12:35,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] Derived loop invariant: (((((((!(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || (((((\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 + 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87 + 1] && v_main_~i~1_87 <= 0) && 0 <= v_main_~i~1_87) && v_main_~i~1_87 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87]) && i == 0) && 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[2]) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3])) || ((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && (\exists v_main_~i~1_159 : int :: (((v_main_~i~1_159 <= 0 && 0 <= v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159] == v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 1] == v_main_~i~1_159 + 1) && 1 <= i)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((lh + 1 <= i && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || (i == rh + 1 && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || (lh == 0 && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 223.5s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 59.8s AutomataDifference, 0.0s DeadEndRemovalTime, 70.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 725 SDtfs, 3130 SDslu, 5545 SDs, 0 SdLazy, 10228 SolverSat, 1680 SolverUnsat, 91 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7398 GetRequests, 6225 SyntacticMatches, 92 SemanticMatches, 1081 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 31708 ImplicationChecksByTransitivity, 89.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, 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.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1742 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 77 PreInvPairs, 632 NumberOfFragments, 998 HoareAnnotationTreeSize, 77 FomulaSimplifications, 184362920 FormulaSimplificationTreeSizeReduction, 13.8s HoareSimplificationTime, 12 FomulaSimplificationsInter, 31842510 FormulaSimplificationTreeSizeReductionInter, 56.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 88.5s InterpolantComputationTime, 5100 NumberOfCodeBlocks, 4575 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 8310 ConstructedInterpolants, 680 QuantifiedInterpolants, 9737595 SizeOfPredicates, 177 NumberOfNonLiveVariables, 5070 ConjunctsInSsa, 697 ConjunctsInUnsatCore, 89 InterpolantComputations, 7 PerfectInterpolantSequences, 16182/22290 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/eureka_05_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-12-35-007.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-12-35-007.csv Received shutdown request...