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-dace188-m [2018-09-14 15:45:52,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:45:52,621 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:45:52,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:45:52,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:45:52,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:45:52,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:45:52,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:45:52,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:45:52,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:45:52,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:45:52,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:45:52,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:45:52,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:45:52,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:45:52,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:45:52,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:45:52,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:45:52,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:45:52,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:45:52,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:45:52,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:45:52,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:45:52,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:45:52,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:45:52,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:45:52,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:45:52,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:45:52,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:45:52,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:45:52,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:45:52,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:45:52,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:45:52,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:45:52,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:45:52,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:45:52,671 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-14 15:45:52,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:45:52,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:45:52,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:45:52,689 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:45:52,689 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:45:52,690 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:45:52,690 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:45:52,690 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:45:52,690 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:45:52,691 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:45:52,691 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:45:52,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:45:52,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:45:52,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:45:52,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:45:52,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:45:52,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:45:52,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:45:52,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:45:52,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:45:52,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:45:52,694 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:45:52,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:45:52,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:45:52,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:45:52,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:45:52,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:45:52,695 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:45:52,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:45:52,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:45:52,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:45:52,696 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:45:52,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:45:52,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:45:52,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:45:52,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:45:52,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:45:52,762 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:45:52,763 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-14 15:45:53,111 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd009e1dc/c45d370225504bbb85091d7bc40d4979/FLAG159dc3218 [2018-09-14 15:45:53,250 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:45:53,251 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-09-14 15:45:53,257 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd009e1dc/c45d370225504bbb85091d7bc40d4979/FLAG159dc3218 [2018-09-14 15:45:53,274 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd009e1dc/c45d370225504bbb85091d7bc40d4979 [2018-09-14 15:45:53,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:45:53,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:45:53,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:45:53,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:45:53,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:45:53,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f42403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53, skipping insertion in model container [2018-09-14 15:45:53,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,315 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:45:53,594 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:45:53,620 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:45:53,639 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:45:53,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53 WrapperNode [2018-09-14 15:45:53,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:45:53,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:45:53,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:45:53,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:45:53,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:45:53,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:45:53,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:45:53,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:45:53,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:45:53,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:45:53,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:45:53,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:45:53,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (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-14 15:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:45:53,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:45:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:45:53,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:45:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-09-14 15:45:53,781 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-09-14 15:45:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:45:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:45:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 15:45:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 15:45:54,319 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:45:54,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:45:54 BoogieIcfgContainer [2018-09-14 15:45:54,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:45:54,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:45:54,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:45:54,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:45:54,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:45:53" (1/3) ... [2018-09-14 15:45:54,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d1c669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:45:54, skipping insertion in model container [2018-09-14 15:45:54,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (2/3) ... [2018-09-14 15:45:54,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d1c669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:45:54, skipping insertion in model container [2018-09-14 15:45:54,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:45:54" (3/3) ... [2018-09-14 15:45:54,331 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-09-14 15:45:54,343 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:45:54,352 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:45:54,398 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:45:54,400 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:45:54,400 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:45:54,400 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:45:54,400 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:45:54,400 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:45:54,400 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:45:54,401 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:45:54,401 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:45:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-09-14 15:45:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-14 15:45:54,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:54,428 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-14 15:45:54,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 163297510, now seen corresponding path program 1 times [2018-09-14 15:45:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:54,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:54,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,491 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:54,570 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-14 15:45:54,572 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:45:54,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-14 15:45:54,573 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:54,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-14 15:45:54,590 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-14 15:45:54,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-14 15:45:54,593 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-09-14 15:45:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:54,618 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-09-14 15:45:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-14 15:45:54,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-14 15:45:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:54,629 INFO L225 Difference]: With dead ends: 63 [2018-09-14 15:45:54,630 INFO L226 Difference]: Without dead ends: 32 [2018-09-14 15:45:54,633 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-14 15:45:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-14 15:45:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-14 15:45:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-14 15:45:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-09-14 15:45:54,672 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-09-14 15:45:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:54,672 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-09-14 15:45:54,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-14 15:45:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-09-14 15:45:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-14 15:45:54,674 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:54,674 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-14 15:45:54,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -541222088, now seen corresponding path program 1 times [2018-09-14 15:45:54,675 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,677 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:54,745 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-14 15:45:54,746 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:45:54,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 15:45:54,746 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:54,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:45:54,748 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:45:54,748 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:45:54,749 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-09-14 15:45:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:54,805 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-14 15:45:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:45:54,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-09-14 15:45:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:54,807 INFO L225 Difference]: With dead ends: 58 [2018-09-14 15:45:54,807 INFO L226 Difference]: Without dead ends: 35 [2018-09-14 15:45:54,808 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-14 15:45:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-14 15:45:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-14 15:45:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-14 15:45:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-09-14 15:45:54,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-09-14 15:45:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:54,817 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-09-14 15:45:54,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:45:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-09-14 15:45:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-14 15:45:54,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:54,818 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-14 15:45:54,819 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:54,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2063291985, now seen corresponding path program 1 times [2018-09-14 15:45:54,819 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:54,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,821 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:54,953 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-14 15:45:54,954 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:45:54,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:45:54,954 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:54,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:45:54,955 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:45:54,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:45:54,955 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-09-14 15:45:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:55,147 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-14 15:45:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:45:55,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-09-14 15:45:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:55,150 INFO L225 Difference]: With dead ends: 55 [2018-09-14 15:45:55,150 INFO L226 Difference]: Without dead ends: 42 [2018-09-14 15:45:55,151 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-14 15:45:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-14 15:45:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-09-14 15:45:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-14 15:45:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-09-14 15:45:55,161 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-09-14 15:45:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:55,161 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-09-14 15:45:55,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:45:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-09-14 15:45:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-14 15:45:55,162 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:55,163 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-14 15:45:55,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1077618875, now seen corresponding path program 1 times [2018-09-14 15:45:55,163 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:55,165 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,503 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-14 15:45:55,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:55,504 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-14 15:45:55,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:55,521 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:55,637 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-14 15:45:55,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:55,764 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-14 15:45:55,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:55,794 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-14 15:45:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:55,810 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:55,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-14 15:45:55,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:55,898 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-14 15:45:55,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:45:55,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 4, 4] total 11 [2018-09-14 15:45:55,900 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:45:55,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 15:45:55,901 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 15:45:55,902 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-14 15:45:55,902 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-09-14 15:45:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:56,347 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-09-14 15:45:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:45:56,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-09-14 15:45:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:56,351 INFO L225 Difference]: With dead ends: 75 [2018-09-14 15:45:56,351 INFO L226 Difference]: Without dead ends: 50 [2018-09-14 15:45:56,352 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-14 15:45:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-14 15:45:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-09-14 15:45:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-14 15:45:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-09-14 15:45:56,361 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2018-09-14 15:45:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:56,362 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-09-14 15:45:56,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 15:45:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-09-14 15:45:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-14 15:45:56,363 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:56,364 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-14 15:45:56,364 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1996404421, now seen corresponding path program 1 times [2018-09-14 15:45:56,364 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:56,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:56,366 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:56,442 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-14 15:45:56,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:56,443 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-14 15:45:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:56,456 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:56,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:56,813 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-14 15:45:56,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:56,873 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-14 15:45:56,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:56,895 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-14 15:45:56,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:56,912 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:56,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:57,117 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-14 15:45:57,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:57,396 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-14 15:45:57,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:45:57,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6] total 17 [2018-09-14 15:45:57,401 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:45:57,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 15:45:57,402 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 15:45:57,402 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-09-14 15:45:57,402 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-09-14 15:45:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:57,643 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-09-14 15:45:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:45:57,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-09-14 15:45:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:57,644 INFO L225 Difference]: With dead ends: 78 [2018-09-14 15:45:57,644 INFO L226 Difference]: Without dead ends: 51 [2018-09-14 15:45:57,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-09-14 15:45:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-14 15:45:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-14 15:45:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-14 15:45:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-14 15:45:57,655 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2018-09-14 15:45:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:57,656 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-14 15:45:57,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 15:45:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-14 15:45:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-14 15:45:57,657 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:57,657 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-14 15:45:57,658 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1535047918, now seen corresponding path program 2 times [2018-09-14 15:45:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:57,660 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:57,843 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-14 15:45:57,843 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:57,843 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-14 15:45:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:45:57,853 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:45:57,873 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:45:57,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:45:57,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:57,987 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-14 15:45:57,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:58,041 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-14 15:45:58,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:58,063 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-14 15:45:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:45:58,082 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:45:58,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:45:58,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:45:58,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:58,261 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-14 15:45:58,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:58,386 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-14 15:45:58,534 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-14 15:45:58,536 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:45:58,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 7] total 20 [2018-09-14 15:45:58,537 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:45:58,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:45:58,539 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:45:58,539 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-09-14 15:45:58,540 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-09-14 15:45:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:58,988 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-09-14 15:45:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-14 15:45:58,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-09-14 15:45:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:58,990 INFO L225 Difference]: With dead ends: 99 [2018-09-14 15:45:58,990 INFO L226 Difference]: Without dead ends: 66 [2018-09-14 15:45:58,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-14 15:45:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-14 15:45:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-09-14 15:45:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-14 15:45:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-09-14 15:45:58,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-09-14 15:45:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:58,999 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-09-14 15:45:58,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:45:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-09-14 15:45:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-14 15:45:59,002 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:59,002 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-14 15:45:59,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 933606354, now seen corresponding path program 3 times [2018-09-14 15:45:59,003 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:45:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,004 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:59,123 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-14 15:45:59,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:59,124 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-14 15:45:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:45:59,133 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:45:59,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-14 15:45:59,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:45:59,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:59,182 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-14 15:45:59,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:59,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:45:59,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:45:59,339 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-14 15:45:59,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:59,554 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-14 15:45:59,576 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:45:59,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 19 [2018-09-14 15:45:59,577 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:59,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 15:45:59,577 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 15:45:59,578 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-09-14 15:45:59,578 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 8 states. [2018-09-14 15:45:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:59,776 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-09-14 15:45:59,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:45:59,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-14 15:45:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:59,778 INFO L225 Difference]: With dead ends: 67 [2018-09-14 15:45:59,778 INFO L226 Difference]: Without dead ends: 65 [2018-09-14 15:45:59,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-09-14 15:45:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-14 15:45:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-14 15:45:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-14 15:45:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-09-14 15:45:59,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-09-14 15:45:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:59,790 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-09-14 15:45:59,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 15:45:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-09-14 15:45:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-14 15:45:59,792 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:59,792 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-14 15:45:59,792 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash -368482959, now seen corresponding path program 1 times [2018-09-14 15:45:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:45:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,794 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:59,917 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-14 15:45:59,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:59,917 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-14 15:45:59,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:59,931 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:59,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:00,040 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-14 15:46:00,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:00,161 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-14 15:46:00,193 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:00,193 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-14 15:46:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:00,218 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:46:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:00,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:00,272 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-14 15:46:00,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:00,521 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-14 15:46:00,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:00,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 12 [2018-09-14 15:46:00,524 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:00,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:46:00,524 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:46:00,525 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-14 15:46:00,525 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 12 states. [2018-09-14 15:46:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:00,838 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-09-14 15:46:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-14 15:46:00,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-09-14 15:46:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:00,845 INFO L225 Difference]: With dead ends: 134 [2018-09-14 15:46:00,845 INFO L226 Difference]: Without dead ends: 90 [2018-09-14 15:46:00,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-14 15:46:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-14 15:46:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-09-14 15:46:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-14 15:46:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-09-14 15:46:00,863 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 61 [2018-09-14 15:46:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:00,864 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-09-14 15:46:00,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:46:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-09-14 15:46:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-14 15:46:00,865 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:00,865 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-14 15:46:00,866 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1636873387, now seen corresponding path program 2 times [2018-09-14 15:46:00,866 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:00,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:00,867 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:01,415 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-14 15:46:01,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:01,416 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-14 15:46:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:01,427 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:01,463 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:01,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:01,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:01,615 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-14 15:46:01,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:01,793 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-14 15:46:01,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:01,816 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-14 15:46:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:01,833 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:01,888 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:01,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:01,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:01,916 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-14 15:46:01,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:02,037 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-14 15:46:02,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:02,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8] total 18 [2018-09-14 15:46:02,039 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:02,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 15:46:02,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 15:46:02,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-09-14 15:46:02,041 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 13 states. [2018-09-14 15:46:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:02,387 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-09-14 15:46:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:46:02,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-09-14 15:46:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:02,393 INFO L225 Difference]: With dead ends: 133 [2018-09-14 15:46:02,393 INFO L226 Difference]: Without dead ends: 89 [2018-09-14 15:46:02,395 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-14 15:46:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-14 15:46:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-09-14 15:46:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-14 15:46:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-09-14 15:46:02,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 74 [2018-09-14 15:46:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:02,424 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-09-14 15:46:02,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 15:46:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-09-14 15:46:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-14 15:46:02,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:02,426 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-14 15:46:02,426 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1695857684, now seen corresponding path program 3 times [2018-09-14 15:46:02,430 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:02,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:02,431 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:02,659 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-14 15:46:02,659 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:02,659 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-14 15:46:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:02,683 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:02,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-14 15:46:02,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:02,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:02,738 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-14 15:46:02,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:02,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:02,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-14 15:46:02,808 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:02,810 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-14 15:46:02,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:02,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:02,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-14 15:46:04,742 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-14 15:46:04,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:05,887 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-14 15:46:05,908 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:05,908 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-14 15:46:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:05,924 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:06,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-14 15:46:06,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:06,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:06,038 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-14 15:46:06,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:06,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:06,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-14 15:46:06,051 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:06,052 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-14 15:46:06,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:06,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:06,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-14 15:46:06,149 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-14 15:46:06,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:06,184 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-14 15:46:06,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:06,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11, 11, 11] total 26 [2018-09-14 15:46:06,188 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:06,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-14 15:46:06,189 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-14 15:46:06,189 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-09-14 15:46:06,189 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-09-14 15:46:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:07,291 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-09-14 15:46:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-14 15:46:07,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-09-14 15:46:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:07,298 INFO L225 Difference]: With dead ends: 154 [2018-09-14 15:46:07,298 INFO L226 Difference]: Without dead ends: 110 [2018-09-14 15:46:07,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-09-14 15:46:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-14 15:46:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-09-14 15:46:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-14 15:46:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-09-14 15:46:07,316 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 78 [2018-09-14 15:46:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-09-14 15:46:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-14 15:46:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-09-14 15:46:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-14 15:46:07,319 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:07,319 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-14 15:46:07,319 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 747975567, now seen corresponding path program 4 times [2018-09-14 15:46:07,320 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:07,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:07,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:07,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:07,321 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:07,522 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-14 15:46:07,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:07,522 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-14 15:46:07,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:07,530 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:07,561 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:07,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:07,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:07,692 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-14 15:46:07,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:07,959 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-14 15:46:07,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:07,980 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-14 15:46:07,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:07,996 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:08,051 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:08,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:08,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:08,077 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-14 15:46:08,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:08,174 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-14 15:46:08,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:08,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9, 8, 9] total 20 [2018-09-14 15:46:08,176 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:08,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 15:46:08,176 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 15:46:08,177 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-09-14 15:46:08,177 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-09-14 15:46:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:08,643 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-09-14 15:46:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:46:08,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-09-14 15:46:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:08,647 INFO L225 Difference]: With dead ends: 181 [2018-09-14 15:46:08,647 INFO L226 Difference]: Without dead ends: 115 [2018-09-14 15:46:08,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 382 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-09-14 15:46:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-14 15:46:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-09-14 15:46:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-14 15:46:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-09-14 15:46:08,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 100 [2018-09-14 15:46:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:08,676 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-09-14 15:46:08,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-14 15:46:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-09-14 15:46:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-14 15:46:08,678 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:08,678 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-14 15:46:08,679 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1940124314, now seen corresponding path program 5 times [2018-09-14 15:46:08,679 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:08,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:08,680 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:08,817 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-14 15:46:08,818 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:08,818 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-14 15:46:08,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:46:08,826 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:08,847 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-14 15:46:08,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:08,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:09,030 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,031 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,033 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,046 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,087 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-14 15:46:09,133 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,137 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,150 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 85 [2018-09-14 15:46:09,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:09,688 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,691 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 20 [2018-09-14 15:46:09,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:09,847 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,848 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,899 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,901 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:09,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, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 76 [2018-09-14 15:46:09,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:10,068 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,069 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,070 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,077 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,078 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 28 treesize of output 49 [2018-09-14 15:46:10,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:10,191 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,192 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,194 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,204 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,210 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 35 treesize of output 64 [2018-09-14 15:46:10,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:10,361 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,362 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,363 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,374 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:10,390 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 4 case distinctions, treesize of input 30 treesize of output 64 [2018-09-14 15:46:10,392 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:10,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:46:10,527 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-14 15:46:10,527 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:36, output treesize:62 [2018-09-14 15:46:11,046 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,050 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,054 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,064 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,070 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:11,106 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-14 15:46:11,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2018-09-14 15:46:11,240 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-14 15:46:11,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:13 [2018-09-14 15:46:11,287 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-14 15:46:11,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:14,449 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,450 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,450 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,455 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,467 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-14 15:46:14,572 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-09-14 15:46:14,578 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,584 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,585 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,586 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,594 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,594 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,595 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,595 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,609 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,610 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,610 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,611 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,612 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:14,612 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,613 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:14,614 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,614 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,615 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,616 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,616 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,617 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,619 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 131 [2018-09-14 15:46:14,621 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,650 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,685 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,692 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,693 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,700 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,701 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,706 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:14,714 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 106 [2018-09-14 15:46:14,716 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:14,722 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,722 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,731 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,731 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,734 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,748 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:14,748 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,825 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:30 [2018-09-14 15:46:14,944 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-14 15:46:14,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:14,965 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-14 15:46:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:46:14,980 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:15,079 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-14 15:46:15,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:15,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:15,096 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,098 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,104 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,125 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,169 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-14 15:46:15,208 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,216 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 64 treesize of output 61 [2018-09-14 15:46:15,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,460 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,462 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,463 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,464 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,466 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 30 treesize of output 49 [2018-09-14 15:46:15,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,632 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,633 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,634 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,635 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 49 [2018-09-14 15:46:15,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,804 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,805 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,806 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,814 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,818 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-14 15:46:15,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,953 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,954 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,955 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,963 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:15,967 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-14 15:46:15,968 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:16,101 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,102 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,102 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,108 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,110 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 47 [2018-09-14 15:46:16,111 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:16,235 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,236 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,237 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,246 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,250 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-14 15:46:16,251 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:16,366 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,368 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,370 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,371 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,372 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2018-09-14 15:46:16,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:16,478 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,479 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,480 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,486 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,493 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-14 15:46:16,494 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:16,627 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-14 15:46:16,667 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-14 15:46:16,668 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:33, output treesize:77 [2018-09-14 15:46:18,208 WARN L178 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-14 15:46:19,751 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-14 15:46:19,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:25,527 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,528 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,528 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,546 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-14 15:46:25,831 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-09-14 15:46:25,835 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,836 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,836 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,844 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,844 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,844 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,846 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,846 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,846 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,847 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:25,848 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:25,849 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,850 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,850 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,851 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,852 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,852 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,853 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,855 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 131 [2018-09-14 15:46:25,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,858 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,867 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,869 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,874 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,876 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,894 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,894 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,940 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,952 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,976 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:25,983 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 106 [2018-09-14 15:46:25,985 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:25,988 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:25,988 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:26,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:26,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:26,059 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:30 [2018-09-14 15:46:26,134 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-14 15:46:26,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:26,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19, 19, 19] total 52 [2018-09-14 15:46:26,137 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:26,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-14 15:46:26,138 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-14 15:46:26,139 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2346, Unknown=2, NotChecked=0, Total=2652 [2018-09-14 15:46:26,140 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 26 states. [2018-09-14 15:46:30,627 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 35 [2018-09-14 15:46:32,826 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-09-14 15:46:33,717 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2018-09-14 15:46:34,447 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-09-14 15:46:36,571 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-09-14 15:46:36,861 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2018-09-14 15:46:37,188 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-09-14 15:46:37,393 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-09-14 15:46:37,640 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-09-14 15:46:37,907 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-09-14 15:46:39,137 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-09-14 15:46:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:39,379 INFO L93 Difference]: Finished difference Result 462 states and 561 transitions. [2018-09-14 15:46:39,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-14 15:46:39,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-09-14 15:46:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:39,383 INFO L225 Difference]: With dead ends: 462 [2018-09-14 15:46:39,383 INFO L226 Difference]: Without dead ends: 396 [2018-09-14 15:46:39,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 446 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9787 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=4213, Invalid=26585, Unknown=2, NotChecked=0, Total=30800 [2018-09-14 15:46:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-09-14 15:46:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-09-14 15:46:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-14 15:46:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2018-09-14 15:46:39,423 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 104 [2018-09-14 15:46:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:39,424 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2018-09-14 15:46:39,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-14 15:46:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2018-09-14 15:46:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-14 15:46:39,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:39,426 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-14 15:46:39,426 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1684566659, now seen corresponding path program 1 times [2018-09-14 15:46:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:39,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:39,428 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:40,271 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 11 [2018-09-14 15:46:40,928 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-09-14 15:46:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 196 proven. 120 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-14 15:46:42,018 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:42,018 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-14 15:46:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:42,026 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:46:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:42,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:42,066 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-14 15:46:42,069 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-14 15:46:42,074 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-14 15:46:42,078 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-14 15:46:42,085 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-14 15:46:42,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,104 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:42,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:46:42,769 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-14 15:46:42,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:43,837 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-14 15:46:43,857 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 15:46:43,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [26, 13] total 47 [2018-09-14 15:46:43,857 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:46:43,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 15:46:43,858 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 15:46:43,859 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1873, Unknown=0, NotChecked=0, Total=2162 [2018-09-14 15:46:43,859 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 13 states. [2018-09-14 15:46:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:44,901 INFO L93 Difference]: Finished difference Result 484 states and 598 transitions. [2018-09-14 15:46:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-14 15:46:44,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-09-14 15:46:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:44,904 INFO L225 Difference]: With dead ends: 484 [2018-09-14 15:46:44,905 INFO L226 Difference]: Without dead ends: 275 [2018-09-14 15:46:44,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-09-14 15:46:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-14 15:46:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 237. [2018-09-14 15:46:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-14 15:46:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2018-09-14 15:46:44,934 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 122 [2018-09-14 15:46:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2018-09-14 15:46:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 15:46:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2018-09-14 15:46:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-14 15:46:44,936 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:44,936 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-14 15:46:44,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 626728581, now seen corresponding path program 2 times [2018-09-14 15:46:44,937 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:44,938 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:45,625 WARN L178 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-09-14 15:46:46,645 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2018-09-14 15:46:47,028 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2018-09-14 15:46:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 204 proven. 126 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 15:46:47,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:47,708 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-14 15:46:47,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:47,726 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:47,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:47,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:47,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:47,867 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-14 15:46:47,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:46:47,927 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:47,928 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-14 15:46:47,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-14 15:46:48,000 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-14 15:46:48,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-14 15:46:48,725 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-14 15:46:48,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:49,130 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-14 15:46:49,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:49,137 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-14 15:46:49,159 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:49,160 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:49,160 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:49,164 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-14 15:46:49,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,190 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:12 [2018-09-14 15:46:49,336 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-14 15:46:49,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:49,357 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-14 15:46:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:49,373 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:49,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:49,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:49,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:49,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-14 15:46:49,478 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-14 15:46:49,500 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-14 15:46:49,503 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-14 15:46:49,508 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-14 15:46:49,508 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:49,556 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:46:50,097 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-14 15:46:50,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:51,021 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-14 15:46:51,023 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-14 15:46:51,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [27, 20, 15, 11] total 75 [2018-09-14 15:46:51,023 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:46:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-14 15:46:51,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-14 15:46:51,026 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5149, Unknown=0, NotChecked=0, Total=5550 [2018-09-14 15:46:51,026 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 11 states. [2018-09-14 15:46:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:51,934 INFO L93 Difference]: Finished difference Result 484 states and 597 transitions. [2018-09-14 15:46:51,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-14 15:46:51,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2018-09-14 15:46:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:51,937 INFO L225 Difference]: With dead ends: 484 [2018-09-14 15:46:51,937 INFO L226 Difference]: Without dead ends: 271 [2018-09-14 15:46:51,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 441 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=478, Invalid=6164, Unknown=0, NotChecked=0, Total=6642 [2018-09-14 15:46:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-14 15:46:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 233. [2018-09-14 15:46:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-14 15:46:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-09-14 15:46:51,968 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 122 [2018-09-14 15:46:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:51,969 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-09-14 15:46:51,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-14 15:46:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-09-14 15:46:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-14 15:46:51,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:51,970 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-14 15:46:51,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash -733917819, now seen corresponding path program 3 times [2018-09-14 15:46:51,971 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:51,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:51,972 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:52,395 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-14 15:46:52,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:52,395 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-14 15:46:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:52,402 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:52,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-14 15:46:52,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:52,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:52,437 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-14 15:46:52,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-14 15:46:52,483 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:52,484 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-14 15:46:52,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-14 15:46:52,530 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:52,531 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:52,532 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:52,533 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-14 15:46:52,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:52,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-14 15:46:52,784 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-14 15:46:52,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:53,068 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-14 15:46:53,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:53,088 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-14 15:46:53,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:53,105 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:53,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-14 15:46:53,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:53,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:53,290 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-14 15:46:53,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-14 15:46:53,299 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:53,300 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-14 15:46:53,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-14 15:46:53,328 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:53,330 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:53,332 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:53,332 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-14 15:46:53,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:53,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-14 15:46:53,431 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-14 15:46:53,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:53,509 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-14 15:46:53,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:53,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 13] total 34 [2018-09-14 15:46:53,511 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:53,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-14 15:46:53,512 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-14 15:46:53,512 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2018-09-14 15:46:53,513 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 25 states. [2018-09-14 15:46:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:55,044 INFO L93 Difference]: Finished difference Result 494 states and 606 transitions. [2018-09-14 15:46:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-14 15:46:55,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2018-09-14 15:46:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:55,047 INFO L225 Difference]: With dead ends: 494 [2018-09-14 15:46:55,047 INFO L226 Difference]: Without dead ends: 313 [2018-09-14 15:46:55,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=380, Invalid=2376, Unknown=0, NotChecked=0, Total=2756 [2018-09-14 15:46:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-14 15:46:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 238. [2018-09-14 15:46:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-14 15:46:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-09-14 15:46:55,082 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 122 [2018-09-14 15:46:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:55,082 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-09-14 15:46:55,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-14 15:46:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-09-14 15:46:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-14 15:46:55,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:55,084 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-14 15:46:55,085 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 882211364, now seen corresponding path program 4 times [2018-09-14 15:46:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:55,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:55,086 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:55,564 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-14 15:46:55,564 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:55,564 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-14 15:46:55,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:55,572 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:55,603 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:55,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:55,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:55,612 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-14 15:46:55,614 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-14 15:46:55,619 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-14 15:46:55,625 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-14 15:46:55,630 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-14 15:46:55,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:55,688 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:46:56,024 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-14 15:46:56,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:56,470 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-14 15:46:56,491 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:56,491 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-14 15:46:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:56,508 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:56,587 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:56,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:56,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:56,596 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-14 15:46:56,601 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-14 15:46:56,609 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-14 15:46:56,611 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-14 15:46:56,617 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-14 15:46:56,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:56,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:46:56,745 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-14 15:46:56,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:56,886 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-14 15:46:56,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:56,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12, 12, 12] total 32 [2018-09-14 15:46:56,888 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:56,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-14 15:46:56,889 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-14 15:46:56,889 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-09-14 15:46:56,889 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 23 states. [2018-09-14 15:46:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:59,573 INFO L93 Difference]: Finished difference Result 560 states and 692 transitions. [2018-09-14 15:46:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-14 15:46:59,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-09-14 15:46:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:59,576 INFO L225 Difference]: With dead ends: 560 [2018-09-14 15:46:59,576 INFO L226 Difference]: Without dead ends: 352 [2018-09-14 15:46:59,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 501 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2018-09-14 15:46:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-14 15:46:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 234. [2018-09-14 15:46:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-14 15:46:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-09-14 15:46:59,620 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 130 [2018-09-14 15:46:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:59,621 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-09-14 15:46:59,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-14 15:46:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-09-14 15:46:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-14 15:46:59,622 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:59,623 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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-14 15:46:59,623 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1712548904, now seen corresponding path program 5 times [2018-09-14 15:46:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:59,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:59,625 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-09-14 15:47:00,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:00,194 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-14 15:47:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:47:00,203 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:47:00,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-14 15:47:00,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:00,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:00,483 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,484 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,485 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,487 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,495 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-14 15:47:00,498 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,499 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,500 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,504 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,506 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-14 15:47:00,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,525 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-14 15:47:00,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-09-14 15:47:00,700 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,700 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,701 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,703 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,707 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-14 15:47:00,714 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,715 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,716 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,721 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:00,724 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-14 15:47:00,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,744 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-14 15:47:00,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2018-09-14 15:47:00,852 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:47:00,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,853 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-14 15:47:00,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:1 [2018-09-14 15:47:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 223 proven. 99 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-09-14 15:47:00,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:06,117 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:06,120 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:06,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:06,192 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-14 15:47:07,040 WARN L178 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 205 [2018-09-14 15:47:07,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,054 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,056 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 0 case distinctions, treesize of input 65 treesize of output 98 [2018-09-14 15:47:07,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,065 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,065 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:07,071 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 46 treesize of output 77 [2018-09-14 15:47:07,098 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,100 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,100 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,101 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,101 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,109 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-09-14 15:47:07,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,132 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,132 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,133 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,134 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,149 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,158 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 1 case distinctions, treesize of input 68 treesize of output 116 [2018-09-14 15:47:07,162 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,162 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,163 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,179 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 79 [2018-09-14 15:47:07,374 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-09-14 15:47:07,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,381 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,382 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,387 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,410 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 35 treesize of output 88 [2018-09-14 15:47:07,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:07,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,449 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,454 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,457 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,472 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,496 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 66 treesize of output 132 [2018-09-14 15:47:07,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,524 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 107 [2018-09-14 15:47:07,580 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,580 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,582 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,583 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,585 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,590 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,590 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,610 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 35 treesize of output 91 [2018-09-14 15:47:07,612 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:07,660 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,766 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,767 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,767 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,777 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,806 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 111 [2018-09-14 15:47:07,917 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-09-14 15:47:07,920 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,920 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,936 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 45 treesize of output 86 [2018-09-14 15:47:07,936 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,992 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,992 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,994 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,996 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,998 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,999 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:07,999 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,005 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,006 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,009 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,034 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 3 case distinctions, treesize of input 55 treesize of output 135 [2018-09-14 15:47:08,038 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 6 xjuncts. [2018-09-14 15:47:08,109 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:08,143 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:08,754 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,755 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,756 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,763 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,770 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,780 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,807 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,870 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 64 treesize of output 154 [2018-09-14 15:47:08,882 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,883 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,884 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,885 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:08,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 124 [2018-09-14 15:47:08,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,970 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,986 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:08,991 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 85 [2018-09-14 15:47:08,992 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:09,023 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:09,442 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,444 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,449 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,451 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,455 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,460 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,470 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,504 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 140 [2018-09-14 15:47:09,680 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-09-14 15:47:09,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,688 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,695 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,695 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,696 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,697 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,701 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,701 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,718 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:09,767 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-14 15:47:09,768 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-14 15:47:09,796 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 36 xjuncts. [2018-09-14 15:47:10,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,138 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,141 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,141 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,145 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,148 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,150 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,152 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,154 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,183 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-14 15:47:10,188 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:10,374 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:10,678 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,679 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,679 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,683 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,685 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,694 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,701 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:10,738 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 140 [2018-09-14 15:47:11,167 WARN L178 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2018-09-14 15:47:11,172 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,173 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,173 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,174 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,174 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,175 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,178 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,178 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,179 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,179 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,180 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,184 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,186 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,204 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 115 [2018-09-14 15:47:11,206 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:11,408 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,409 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,409 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,410 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,412 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,417 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,418 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,422 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,426 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,429 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,431 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,437 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,439 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,483 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 171 [2018-09-14 15:47:11,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-14 15:47:11,514 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 36 xjuncts. [2018-09-14 15:47:11,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,889 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,895 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,896 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,899 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,899 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,900 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,901 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,901 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,902 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,904 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,909 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,910 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:11,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 143 [2018-09-14 15:47:11,958 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 10 xjuncts. [2018-09-14 15:47:12,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,141 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,142 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,142 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,145 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,147 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,149 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,161 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,162 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,162 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,164 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,191 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 52 treesize of output 121 [2018-09-14 15:47:12,195 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 6 xjuncts. [2018-09-14 15:47:12,401 INFO L267 ElimStorePlain]: Start of recursive call 21: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:12,905 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,910 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,911 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,911 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,912 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,912 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,913 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,915 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,919 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:12,951 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-14 15:47:13,125 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-09-14 15:47:13,132 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,138 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,144 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,149 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,187 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-14 15:47:13,191 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:13,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,309 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,310 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,310 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,311 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,311 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,312 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,312 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,317 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,318 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,321 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,321 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,348 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 3 case distinctions, treesize of input 51 treesize of output 135 [2018-09-14 15:47:13,352 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:13,445 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:13,511 INFO L267 ElimStorePlain]: Start of recursive call 15: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:13,515 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,516 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,516 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,518 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,523 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,524 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,551 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 66 treesize of output 127 [2018-09-14 15:47:13,554 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,555 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,555 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,556 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,556 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,558 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:13,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 142 [2018-09-14 15:47:13,624 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,624 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,626 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,626 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,627 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,627 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,628 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,629 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,640 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 34 treesize of output 79 [2018-09-14 15:47:13,641 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:13,661 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:13,713 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,718 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,718 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,719 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,724 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,725 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:13,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,727 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,760 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 61 treesize of output 154 [2018-09-14 15:47:13,939 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-09-14 15:47:13,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,985 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:13,998 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,011 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,024 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,043 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,047 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,062 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-09-14 15:47:14,074 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 2 case distinctions, treesize of input 56 treesize of output 122 [2018-09-14 15:47:14,077 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:14,179 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,179 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,180 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,180 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,184 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,185 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,195 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 94 [2018-09-14 15:47:14,196 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:14,221 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:14,234 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:14,528 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,543 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,580 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 6 case distinctions, treesize of input 62 treesize of output 112 [2018-09-14 15:47:14,587 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,591 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,592 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,630 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 95 treesize of output 114 [2018-09-14 15:47:14,821 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-09-14 15:47:14,823 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,824 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,824 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,824 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,825 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,825 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,827 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,829 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 89 [2018-09-14 15:47:14,848 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:14,952 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,953 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,953 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,956 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,959 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:14,995 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-14 15:47:14,999 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:15,122 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,126 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,133 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,175 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-14 15:47:15,180 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 6 xjuncts. [2018-09-14 15:47:15,254 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:15,323 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,325 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,326 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,326 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,330 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,356 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 105 [2018-09-14 15:47:15,533 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-09-14 15:47:15,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,538 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 64 [2018-09-14 15:47:15,553 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:15,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,646 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,651 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:15,680 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 3 case distinctions, treesize of input 56 treesize of output 92 [2018-09-14 15:47:15,684 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 6 xjuncts. [2018-09-14 15:47:15,962 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:16,016 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:16,154 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,156 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,158 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,161 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,163 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,167 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,174 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 64 treesize of output 161 [2018-09-14 15:47:16,267 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,267 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,271 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,272 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,276 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,315 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 5 case distinctions, treesize of input 117 treesize of output 140 [2018-09-14 15:47:16,525 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-09-14 15:47:16,528 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,538 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,541 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,542 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,544 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,589 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 71 treesize of output 153 [2018-09-14 15:47:16,598 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 12 xjuncts. [2018-09-14 15:47:16,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,934 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:16,967 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 122 [2018-09-14 15:47:16,970 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:17,081 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:47:18,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,309 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,311 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,312 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,315 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:18,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,335 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 118 [2018-09-14 15:47:18,391 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,392 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,392 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,393 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,393 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,394 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,394 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,394 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,395 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,396 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,398 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,399 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,399 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,400 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,401 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,404 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,410 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 120 [2018-09-14 15:47:18,423 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:18,487 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:18,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,769 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,769 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,793 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 1 case distinctions, treesize of input 72 treesize of output 115 [2018-09-14 15:47:18,853 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,856 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,857 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,857 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,858 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,858 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,866 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,872 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,877 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:18,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 119 [2018-09-14 15:47:18,887 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:18,968 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:19,484 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,486 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,486 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,487 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,492 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,494 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,496 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,497 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,549 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 76 treesize of output 137 [2018-09-14 15:47:19,764 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-09-14 15:47:19,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,770 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,770 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,777 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,777 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,781 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,782 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,782 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,783 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:19,838 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 71 treesize of output 162 [2018-09-14 15:47:19,850 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 18 xjuncts. [2018-09-14 15:47:20,129 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,132 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,133 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:20,171 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 60 treesize of output 126 [2018-09-14 15:47:20,175 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:20,379 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:47:21,225 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,226 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,228 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,231 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,231 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,232 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,232 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,233 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,234 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,235 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,264 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 3 case distinctions, treesize of input 65 treesize of output 139 [2018-09-14 15:47:21,454 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-09-14 15:47:21,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,460 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,461 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,461 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,462 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,462 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,463 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,472 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 86 [2018-09-14 15:47:21,473 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:21,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,538 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,539 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,539 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,541 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,541 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,542 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,543 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,543 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,544 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,556 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 0 case distinctions, treesize of input 61 treesize of output 118 [2018-09-14 15:47:21,557 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:21,618 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,619 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,619 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,620 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,621 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,622 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,623 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,623 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,624 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,626 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,627 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,627 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,630 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:21,649 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 56 treesize of output 117 [2018-09-14 15:47:21,650 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:21,722 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:22,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,117 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,118 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,146 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 100 [2018-09-14 15:47:22,281 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-09-14 15:47:22,284 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,284 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,286 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,286 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,287 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,293 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-14 15:47:22,294 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:22,342 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,342 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,342 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,343 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,344 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,346 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,346 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,347 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,347 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,363 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-09-14 15:47:22,365 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:22,414 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:22,488 INFO L267 ElimStorePlain]: Start of recursive call 43: 18 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:22,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,872 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,872 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,877 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,963 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-14 15:47:22,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,979 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,979 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,980 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,980 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:22,981 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,021 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 102 treesize of output 137 [2018-09-14 15:47:23,178 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-09-14 15:47:23,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,182 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,189 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 40 treesize of output 62 [2018-09-14 15:47:23,189 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:23,245 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,251 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,251 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,252 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,252 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,253 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,254 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,254 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,255 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,255 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,284 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 49 treesize of output 124 [2018-09-14 15:47:23,287 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:23,369 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,371 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,375 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,375 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,376 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,377 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,377 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,378 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,378 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,414 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 44 treesize of output 123 [2018-09-14 15:47:23,417 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 8 xjuncts. [2018-09-14 15:47:23,485 INFO L267 ElimStorePlain]: Start of recursive call 62: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:23,830 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,832 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,838 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,838 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,853 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:23,911 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 67 treesize of output 143 [2018-09-14 15:47:24,225 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-09-14 15:47:24,233 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,234 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,237 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,242 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,243 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,248 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,254 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,255 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,336 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 7 case distinctions, treesize of input 68 treesize of output 175 [2018-09-14 15:47:24,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-14 15:47:24,390 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 56 xjuncts. [2018-09-14 15:47:24,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:24,989 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 100 [2018-09-14 15:47:24,991 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:25,180 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,183 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,186 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,187 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,188 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,188 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,193 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,194 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,205 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,207 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,217 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,266 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 6 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 183 [2018-09-14 15:47:25,266 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-09-14 15:47:25,354 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 58 xjuncts. [2018-09-14 15:47:25,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,807 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,807 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,811 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,813 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,814 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:25,814 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,818 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:25,859 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 57 treesize of output 106 [2018-09-14 15:47:25,860 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:26,001 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,002 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,002 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,003 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,009 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,009 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,017 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,018 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,018 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,027 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:26,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 184 [2018-09-14 15:47:26,109 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-09-14 15:47:26,533 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 234 xjuncts. [2018-09-14 15:47:28,461 INFO L267 ElimStorePlain]: Start of recursive call 66: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:28,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,832 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,833 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,833 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,834 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,834 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,835 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,836 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,841 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:28,872 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 150 [2018-09-14 15:47:29,059 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-09-14 15:47:29,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,066 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:29,066 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,067 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,068 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 81 [2018-09-14 15:47:29,068 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:29,142 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,144 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,144 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,147 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,148 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,150 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,151 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,151 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,152 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,154 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,156 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,159 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,160 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,161 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,164 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,165 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,175 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 133 [2018-09-14 15:47:29,176 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:29,271 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,272 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,275 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,276 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,277 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,278 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,279 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,280 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,283 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,284 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,286 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,289 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,314 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 65 treesize of output 129 [2018-09-14 15:47:29,315 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:29,414 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:29,719 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,719 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,720 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,721 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,721 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,722 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,722 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,725 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,731 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,770 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 58 treesize of output 133 [2018-09-14 15:47:29,919 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-09-14 15:47:29,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,933 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:29,964 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 56 treesize of output 138 [2018-09-14 15:47:29,966 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:30,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,084 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,084 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,087 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:30,087 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,088 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,096 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 47 treesize of output 77 [2018-09-14 15:47:30,097 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:30,158 INFO L267 ElimStorePlain]: Start of recursive call 76: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:30,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:30,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,001 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 104 [2018-09-14 15:47:31,133 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-09-14 15:47:31,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,137 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,138 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,138 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,145 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-14 15:47:31,145 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:31,202 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,203 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,203 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,204 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,204 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,206 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,207 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,207 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,208 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,225 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-09-14 15:47:31,226 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:31,276 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:31,348 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, 18 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:47:31,473 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,473 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,474 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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-14 15:47:31,484 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,486 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-14 15:47:31,498 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,499 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,499 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,502 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-14 15:47:31,503 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:31,506 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:31,513 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:31,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:47:31,573 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-14 15:47:31,574 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 3 variables, input treesize:88, output treesize:67 [2018-09-14 15:47:31,697 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-14 15:47:31,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:31,720 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-14 15:47:31,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:47:31,736 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:47:32,001 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-14 15:47:32,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:32,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:32,017 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-14 15:47:32,039 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-14 15:47:32,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-14 15:47:32,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:32,046 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-14 15:47:32,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-09-14 15:47:32,095 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,095 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,096 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,097 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,103 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-14 15:47:32,106 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,107 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,108 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,114 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-14 15:47:32,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:32,125 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-14 15:47:32,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:32,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-09-14 15:47:32,385 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,386 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,387 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,389 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,394 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-14 15:47:32,397 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,398 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,398 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:32,404 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-14 15:47:32,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:32,414 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-14 15:47:32,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:32,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-09-14 15:47:32,562 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-14 15:47:32,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:35,083 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-14 15:47:35,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:47:35,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 17, 14, 14] total 65 [2018-09-14 15:47:35,085 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:47:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-14 15:47:35,085 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-14 15:47:35,086 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3862, Unknown=4, NotChecked=0, Total=4160 [2018-09-14 15:47:35,086 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 33 states. [2018-09-14 15:47:41,635 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-09-14 15:47:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:47:43,213 INFO L93 Difference]: Finished difference Result 730 states and 915 transitions. [2018-09-14 15:47:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-14 15:47:43,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-09-14 15:47:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:47:43,217 INFO L225 Difference]: With dead ends: 730 [2018-09-14 15:47:43,217 INFO L226 Difference]: Without dead ends: 541 [2018-09-14 15:47:43,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1639, Invalid=16447, Unknown=4, NotChecked=0, Total=18090 [2018-09-14 15:47:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-09-14 15:47:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 301. [2018-09-14 15:47:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-14 15:47:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 359 transitions. [2018-09-14 15:47:43,273 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 359 transitions. Word has length 130 [2018-09-14 15:47:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:47:43,273 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 359 transitions. [2018-09-14 15:47:43,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-14 15:47:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 359 transitions. [2018-09-14 15:47:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-14 15:47:43,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:47:43,274 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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-14 15:47:43,274 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:47:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash 475951532, now seen corresponding path program 6 times [2018-09-14 15:47:43,275 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:47:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:43,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:47:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:43,276 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:47:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:43,803 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-14 15:47:43,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:43,803 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-14 15:47:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-14 15:47:43,812 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-14 15:47:43,840 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-14 15:47:43,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:43,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:43,877 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-14 15:47:43,881 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-14 15:47:43,884 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-14 15:47:43,886 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-14 15:47:43,887 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-14 15:47:43,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:43,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:47:44,130 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-14 15:47:44,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:44,496 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-14 15:47:44,517 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:44,517 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-14 15:47:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-14 15:47:44,533 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-14 15:47:44,751 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-14 15:47:44,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:44,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:44,764 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-14 15:47:44,769 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-14 15:47:44,773 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-14 15:47:44,775 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-14 15:47:44,777 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-14 15:47:44,777 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:44,831 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:47:44,924 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-14 15:47:44,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:45,359 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-14 15:47:45,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:47:45,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9, 10, 9] total 27 [2018-09-14 15:47:45,361 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:47:45,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-14 15:47:45,362 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-14 15:47:45,362 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=611, Unknown=2, NotChecked=0, Total=702 [2018-09-14 15:47:45,362 INFO L87 Difference]: Start difference. First operand 301 states and 359 transitions. Second operand 21 states. [2018-09-14 15:47:47,740 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2018-09-14 15:47:48,941 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-09-14 15:47:50,537 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-09-14 15:47:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:47:50,798 INFO L93 Difference]: Finished difference Result 868 states and 1067 transitions. [2018-09-14 15:47:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-14 15:47:50,798 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2018-09-14 15:47:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:47:50,802 INFO L225 Difference]: With dead ends: 868 [2018-09-14 15:47:50,802 INFO L226 Difference]: Without dead ends: 630 [2018-09-14 15:47:50,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 503 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1028, Invalid=4068, Unknown=16, NotChecked=0, Total=5112 [2018-09-14 15:47:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-09-14 15:47:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 355. [2018-09-14 15:47:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-14 15:47:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 424 transitions. [2018-09-14 15:47:50,880 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 424 transitions. Word has length 130 [2018-09-14 15:47:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:47:50,880 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 424 transitions. [2018-09-14 15:47:50,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-14 15:47:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 424 transitions. [2018-09-14 15:47:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-14 15:47:50,881 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:47:50,881 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-14 15:47:50,881 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:47:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1758276432, now seen corresponding path program 7 times [2018-09-14 15:47:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:47:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:50,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:47:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:50,883 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:47:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:51,120 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-14 15:47:51,454 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-09-14 15:47:51,671 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-09-14 15:47:51,878 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-09-14 15:47:52,205 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2018-09-14 15:47:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 294 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-14 15:47:53,131 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:53,131 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-14 15:47:53,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:47:53,138 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:47:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:53,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:53,196 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-14 15:47:53,197 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-14 15:47:53,199 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-14 15:47:53,200 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-14 15:47:53,202 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-14 15:47:53,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:53,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-14 15:47:54,081 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-14 15:47:54,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:58,201 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-14 15:47:58,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:58,223 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-14 15:47:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:47:58,238 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:47:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:58,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:58,439 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-14 15:47:58,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:47:58,539 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,539 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-14 15:47:58,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-14 15:47:58,662 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,663 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,665 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,665 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-14 15:47:58,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,680 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-14 15:47:58,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-14 15:47:58,822 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,824 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,825 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,826 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,828 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,829 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:58,830 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-14 15:47:58,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:58,854 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-14 15:47:58,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-14 15:47:59,616 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-14 15:47:59,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:00,604 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-14 15:48:00,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:00,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:00,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-14 15:48:00,655 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-14 15:48:00,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:48:00,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 17, 17, 12] total 77 [2018-09-14 15:48:00,657 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:48:00,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-14 15:48:00,658 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-14 15:48:00,659 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=5421, Unknown=11, NotChecked=0, Total=5852 [2018-09-14 15:48:00,659 INFO L87 Difference]: Start difference. First operand 355 states and 424 transitions. Second operand 40 states. [2018-09-14 15:48:01,658 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 33 [2018-09-14 15:48:01,881 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 38 [2018-09-14 15:48:02,731 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 35 [2018-09-14 15:48:03,413 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2018-09-14 15:48:03,782 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2018-09-14 15:48:04,406 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2018-09-14 15:48:04,947 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 33 [2018-09-14 15:48:05,370 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-09-14 15:48:05,549 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-14 15:48:05,899 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 34 [2018-09-14 15:48:06,320 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2018-09-14 15:48:06,518 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 31 [2018-09-14 15:48:07,080 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 33 [2018-09-14 15:48:07,601 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-09-14 15:48:08,146 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 39 [2018-09-14 15:48:09,055 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2018-09-14 15:48:09,712 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 38 [2018-09-14 15:48:09,918 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-09-14 15:48:10,216 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2018-09-14 15:48:10,488 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-09-14 15:48:10,838 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2018-09-14 15:48:11,072 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2018-09-14 15:48:11,345 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2018-09-14 15:48:11,563 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2018-09-14 15:48:11,856 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2018-09-14 15:48:12,300 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-09-14 15:48:12,560 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 36 [2018-09-14 15:48:12,918 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2018-09-14 15:48:13,350 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2018-09-14 15:48:13,678 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2018-09-14 15:48:13,875 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2018-09-14 15:48:14,637 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 39 [2018-09-14 15:48:14,879 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2018-09-14 15:48:15,210 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 38 [2018-09-14 15:48:15,748 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-09-14 15:48:16,098 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-09-14 15:48:16,755 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 29 [2018-09-14 15:48:17,006 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2018-09-14 15:48:17,971 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 44 [2018-09-14 15:48:18,360 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2018-09-14 15:48:18,634 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 27 [2018-09-14 15:48:19,011 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2018-09-14 15:48:19,655 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 29 [2018-09-14 15:48:19,992 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-09-14 15:48:20,488 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 37 [2018-09-14 15:48:21,137 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2018-09-14 15:48:22,372 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2018-09-14 15:48:22,661 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-09-14 15:48:23,033 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2018-09-14 15:48:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:48:23,217 INFO L93 Difference]: Finished difference Result 1150 states and 1412 transitions. [2018-09-14 15:48:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-14 15:48:23,217 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 130 [2018-09-14 15:48:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:48:23,222 INFO L225 Difference]: With dead ends: 1150 [2018-09-14 15:48:23,222 INFO L226 Difference]: Without dead ends: 853 [2018-09-14 15:48:23,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 460 SyntacticMatches, 9 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13253 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=5057, Invalid=34677, Unknown=66, NotChecked=0, Total=39800 [2018-09-14 15:48:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-09-14 15:48:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 502. [2018-09-14 15:48:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-14 15:48:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 604 transitions. [2018-09-14 15:48:23,332 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 604 transitions. Word has length 130 [2018-09-14 15:48:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:48:23,332 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 604 transitions. [2018-09-14 15:48:23,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-14 15:48:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 604 transitions. [2018-09-14 15:48:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-14 15:48:23,334 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:48:23,334 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-14 15:48:23,334 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:48:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -850447564, now seen corresponding path program 1 times [2018-09-14 15:48:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:48:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:48:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:23,335 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:48:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:48:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 86 proven. 67 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-14 15:48:23,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:23,911 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-14 15:48:23,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:48:23,920 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:48:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:48:23,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:24,178 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-14 15:48:24,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:48:24,212 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,213 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-14 15:48:24,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-09-14 15:48:24,276 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,278 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 21 treesize of output 36 [2018-09-14 15:48:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-09-14 15:48:24,361 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,363 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,364 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,365 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,366 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:24,367 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 30 treesize of output 65 [2018-09-14 15:48:24,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:24,389 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-14 15:48:24,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-09-14 15:48:24,837 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-14 15:48:24,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:25,163 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-14 15:48:25,165 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,166 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-14 15:48:25,168 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,170 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-14 15:48:25,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:25,204 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-14 15:48:25,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:29, output treesize:17 [2018-09-14 15:48:25,327 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-14 15:48:25,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:25,348 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-14 15:48:25,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:48:25,364 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:48:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:48:25,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:25,460 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-14 15:48:25,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:48:25,541 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,542 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-14 15:48:25,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-14 15:48:25,670 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,671 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,672 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,673 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-14 15:48:25,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,687 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-14 15:48:25,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-14 15:48:25,795 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,797 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,799 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,801 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,803 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,804 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:25,805 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-14 15:48:25,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:25,830 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-14 15:48:25,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-14 15:48:26,168 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-14 15:48:26,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:26,262 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-14 15:48:26,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:26,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:26,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-14 15:48:26,287 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-14 15:48:26,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:48:26,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17, 17, 12] total 60 [2018-09-14 15:48:26,289 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:48:26,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-14 15:48:26,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-14 15:48:26,290 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3100, Unknown=0, NotChecked=0, Total=3540 [2018-09-14 15:48:26,290 INFO L87 Difference]: Start difference. First operand 502 states and 604 transitions. Second operand 38 states. [2018-09-14 15:48:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:48:29,231 INFO L93 Difference]: Finished difference Result 999 states and 1229 transitions. [2018-09-14 15:48:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-14 15:48:29,231 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 130 [2018-09-14 15:48:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:48:29,236 INFO L225 Difference]: With dead ends: 999 [2018-09-14 15:48:29,236 INFO L226 Difference]: Without dead ends: 997 [2018-09-14 15:48:29,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 487 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=895, Invalid=7477, Unknown=0, NotChecked=0, Total=8372 [2018-09-14 15:48:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-09-14 15:48:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 510. [2018-09-14 15:48:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-09-14 15:48:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 612 transitions. [2018-09-14 15:48:29,384 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 612 transitions. Word has length 130 [2018-09-14 15:48:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:48:29,384 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 612 transitions. [2018-09-14 15:48:29,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-14 15:48:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 612 transitions. [2018-09-14 15:48:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-14 15:48:29,386 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:48:29,386 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-14 15:48:29,386 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:48:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2079744723, now seen corresponding path program 2 times [2018-09-14 15:48:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:48:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:29,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:48:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:29,387 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:48:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:48:29,805 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-09-14 15:48:30,065 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-09-14 15:48:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-09-14 15:48:30,213 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:30,213 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-14 15:48:30,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:48:30,221 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:48:30,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:48:30,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:48:30,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:30,279 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-14 15:48:30,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:48:30,768 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,769 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-14 15:48:30,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-14 15:48:30,895 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,896 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,897 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-14 15:48:30,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-09-14 15:48:30,948 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,948 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,950 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:30,951 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-14 15:48:30,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:30,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2018-09-14 15:48:31,021 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-14 15:48:31,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-09-14 15:48:31,441 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-14 15:48:31,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:31,876 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-14 15:48:31,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,879 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-14 15:48:31,882 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,882 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,883 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,884 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-14 15:48:31,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,889 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,889 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,890 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-14 15:48:31,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:31,933 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-14 15:48:31,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:31,990 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:36, output treesize:22 [2018-09-14 15:48:32,052 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-14 15:48:32,072 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:32,072 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-14 15:48:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:48:32,089 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:48:32,203 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:48:32,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:48:32,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:32,217 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-14 15:48:32,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-14 15:48:32,229 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,229 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-14 15:48:32,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-14 15:48:32,316 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,317 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,318 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,319 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-14 15:48:32,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,334 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-14 15:48:32,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-14 15:48:32,425 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,426 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,427 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,427 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,429 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,430 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,431 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-14 15:48:32,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,458 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-14 15:48:32,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-09-14 15:48:32,579 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,580 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,580 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,581 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,583 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,587 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,588 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,590 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:48:32,591 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-14 15:48:32,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:32,633 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-14 15:48:32,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-14 15:48:33,206 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-14 15:48:33,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:34,673 WARN L979 $PredicateComparison]: unable to prove that (forall ((v_main_~i~1_321 Int)) (or (= 4 (select (store c_main_~array~1 v_main_~i~1_321 v_main_~i~1_321) 4)) (< c_main_~i~1 (+ v_main_~i~1_321 1)))) is different from false [2018-09-14 15:48:34,754 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-14 15:48:34,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:34,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:48:34,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-14 15:48:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 392 trivial. 4 not checked. [2018-09-14 15:48:34,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:48:34,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27, 19, 20, 14] total 73 [2018-09-14 15:48:34,790 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:48:34,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-14 15:48:34,791 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-14 15:48:34,791 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=4251, Unknown=2, NotChecked=140, Total=5256 [2018-09-14 15:48:34,791 INFO L87 Difference]: Start difference. First operand 510 states and 612 transitions. Second operand 40 states. [2018-09-14 15:48:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:48:36,118 INFO L93 Difference]: Finished difference Result 1317 states and 1622 transitions. [2018-09-14 15:48:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-14 15:48:36,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 138 [2018-09-14 15:48:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:48:36,118 INFO L225 Difference]: With dead ends: 1317 [2018-09-14 15:48:36,119 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 15:48:36,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 490 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=919, Invalid=4633, Unknown=2, NotChecked=146, Total=5700 [2018-09-14 15:48:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 15:48:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 15:48:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 15:48:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 15:48:36,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-09-14 15:48:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:48:36,121 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 15:48:36,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-14 15:48:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 15:48:36,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 15:48:36,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 15:48:36,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:36,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:37,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:38,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:38,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:39,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:39,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:40,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:40,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:40,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:41,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:42,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:44,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:44,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:44,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:45,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:46,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:46,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:46,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:47,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:47,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:47,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:47,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:48,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:48,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:48,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:49,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:49,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:49,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:50,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:50,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:51,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:52,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:52,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:52,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:52,962 WARN L178 SmtUtils]: Spent 16.80 s on a formula simplification. DAG size of input: 1392 DAG size of output: 1193 [2018-09-14 15:48:52,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:53,486 WARN L178 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 287 [2018-09-14 15:49:33,924 WARN L178 SmtUtils]: Spent 40.24 s on a formula simplification. DAG size of input: 1190 DAG size of output: 41 [2018-09-14 15:49:34,056 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 57 [2018-09-14 15:49:34,653 WARN L178 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 78 [2018-09-14 15:49:35,123 WARN L178 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2018-09-14 15:49:35,755 WARN L178 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 65 [2018-09-14 15:49:37,479 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 299 DAG size of output: 42 [2018-09-14 15:49:37,481 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:49:37,482 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~array~0 |old(~array~0)|) [2018-09-14 15:49:37,482 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:49:37,482 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:49:37,482 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 (select ~array~0 3)) (<= ~n~0 5) (= 0 (select ~array~0 1)) (= 0 (select ~array~0 4)) (= 0 (select ~array~0 2)) (<= 5 ~n~0) (= (select ~array~0 0) 0)) [2018-09-14 15:49:37,482 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:49:37,482 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:49:37,482 INFO L426 ceAbstractionStarter]: For program point SelectionSortEXIT(lines 15 27) no Hoare annotation was computed. [2018-09-14 15:49:37,482 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 21 22) no Hoare annotation was computed. [2018-09-14 15:49:37,483 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-09-14 15:49:37,483 INFO L426 ceAbstractionStarter]: For program point L21-3(lines 21 22) no Hoare annotation was computed. [2018-09-14 15:49:37,483 INFO L422 ceAbstractionStarter]: At program point L21-4(lines 21 22) the Hoare annotation is: (or (not (= 0 (select |old(~array~0)| 0))) (not (= 0 (select |old(~array~0)| 4))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (let ((.cse0 (+ SelectionSort_~lh~0 1))) (and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) (<= .cse0 ~n~0) (= .cse0 SelectionSort_~i~0))) (not (= (select |old(~array~0)| 2) 0)) (and (<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0) (<= SelectionSort_~i~0 ~n~0)) (< 5 ~n~0) (< ~n~0 5)) [2018-09-14 15:49:37,483 INFO L426 ceAbstractionStarter]: For program point L21-5(lines 21 22) no Hoare annotation was computed. [2018-09-14 15:49:37,483 INFO L426 ceAbstractionStarter]: For program point L19-3(lines 19 26) no Hoare annotation was computed. [2018-09-14 15:49:37,483 INFO L422 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= SelectionSort_~i~0 ~n~0))) (or (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and (= ~array~0 |old(~array~0)|) (= 0 SelectionSort_~lh~0)) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (and (<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0) .cse0) (< ~n~0 5) (not (= 0 (select |old(~array~0)| 0))) (and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) .cse0) (< 5 ~n~0))) [2018-09-14 15:49:37,483 INFO L426 ceAbstractionStarter]: For program point L19-5(lines 15 27) no Hoare annotation was computed. [2018-09-14 15:49:37,484 INFO L422 ceAbstractionStarter]: At program point SelectionSortENTRY(lines 15 27) the Hoare annotation is: (or (< ~n~0 5) (= ~array~0 |old(~array~0)|) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-14 15:49:37,484 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-14 15:49:37,484 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 33 34) no Hoare annotation was computed. [2018-09-14 15:49:37,484 INFO L426 ceAbstractionStarter]: For program point L33-3(lines 33 34) no Hoare annotation was computed. [2018-09-14 15:49:37,484 INFO L422 ceAbstractionStarter]: At program point L33-4(lines 33 34) the Hoare annotation is: (let ((.cse6 (select main_~array~1 4))) (let ((.cse2 (let ((.cse9 (+ main_~i~1 2))) (= .cse9 (select main_~array~1 .cse9)))) (.cse4 (= 4 .cse6)) (.cse1 (= 3 (select main_~array~1 3))) (.cse0 (= ~array~0 |old(~array~0)|))) (or (and (= main_~i~1 4) .cse0) (< ~n~0 5) (and .cse1 .cse0 (<= main_~i~1 2) .cse2 (<= 2 main_~i~1)) (and (= main_~i~1 0) .cse1 (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (= v_main_~i~1_87 (select main_~array~1 v_main_~i~1_87)) (let ((.cse3 (+ v_main_~i~1_87 1))) (= .cse3 (select main_~array~1 .cse3))) (<= 0 v_main_~i~1_87))) .cse4 .cse0 .cse2) (and (let ((.cse5 (+ main_~i~1 1))) (= .cse5 (select main_~array~1 .cse5))) .cse4 (= main_~i~1 1) .cse0 .cse2) (not (= 0 (select |old(~array~0)| 0))) (and .cse4 .cse0 (= main_~i~1 3)) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and .cse1 (exists ((v_main_~i~1_45 Int)) (and (<= v_main_~i~1_45 (+ main_~i~1 1)) (= v_main_~i~1_45 (select main_~array~1 v_main_~i~1_45)) (<= 0 v_main_~i~1_45))) (<= main_~i~1 1) (= .cse6 4) (exists ((main_~i~1 Int)) (and (= (select main_~array~1 main_~i~1) main_~i~1) (<= main_~i~1 0) (<= 0 main_~i~1) (let ((.cse7 (+ main_~i~1 2))) (= .cse7 (select main_~array~1 .cse7))) (let ((.cse8 (+ main_~i~1 1))) (= .cse8 (select main_~array~1 .cse8))))) .cse0) (< 5 ~n~0) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))))) [2018-09-14 15:49:37,485 INFO L422 ceAbstractionStarter]: At program point L33-5(lines 33 34) the Hoare annotation is: (or (< ~n~0 5) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (and (= 3 (select main_~array~1 3)) (exists ((v_main_~i~1_45 Int)) (and (<= v_main_~i~1_45 (+ main_~i~1 1)) (= v_main_~i~1_45 (select main_~array~1 v_main_~i~1_45)) (<= 0 v_main_~i~1_45))) (<= main_~i~1 1) (= (select main_~array~1 4) 4) (exists ((main_~i~1 Int)) (and (= (select main_~array~1 main_~i~1) main_~i~1) (<= main_~i~1 0) (<= 0 main_~i~1) (let ((.cse0 (+ main_~i~1 2))) (= .cse0 (select main_~array~1 .cse0))) (let ((.cse1 (+ main_~i~1 1))) (= .cse1 (select main_~array~1 .cse1))))) (= ~array~0 |old(~array~0)|)) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-14 15:49:37,485 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 29 41) no Hoare annotation was computed. [2018-09-14 15:49:37,485 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-09-14 15:49:37,485 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-14 15:49:37,485 INFO L422 ceAbstractionStarter]: At program point L38-3(lines 38 39) the Hoare annotation is: (let ((.cse3 (= 3 (select main_~array~1 3))) (.cse0 (= 4 (select main_~array~1 4)))) (or (< ~n~0 5) (and .cse0 (and (exists ((v_main_~i~1_159 Int)) (and (= (select main_~array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse1 (+ v_main_~i~1_159 1))) (= .cse1 (select main_~array~1 .cse1))) (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse2 (+ v_main_~i~1_159 2))) (= (select main_~array~1 .cse2) .cse2)))) (<= 1 main_~i~1)) .cse3) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (and (= main_~i~1 0) .cse3 .cse0 (exists ((v_prenex_123 Int)) (and (let ((.cse4 (+ v_prenex_123 1))) (= .cse4 (select main_~array~1 .cse4))) (<= 0 v_prenex_123) (<= v_prenex_123 0) (= (select main_~array~1 v_prenex_123) v_prenex_123) (let ((.cse5 (+ v_prenex_123 2))) (= .cse5 (select main_~array~1 .cse5)))))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))))) [2018-09-14 15:49:37,485 INFO L426 ceAbstractionStarter]: For program point L38-4(lines 29 41) no Hoare annotation was computed. [2018-09-14 15:49:37,486 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 29 41) the Hoare annotation is: (or (< ~n~0 5) (= ~array~0 |old(~array~0)|) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-14 15:49:37,486 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse2 (exists ((v_prenex_123 Int)) (and (let ((.cse6 (+ v_prenex_123 1))) (= .cse6 (select main_~array~1 .cse6))) (<= 0 v_prenex_123) (<= v_prenex_123 0) (= (select main_~array~1 v_prenex_123) v_prenex_123) (let ((.cse7 (+ v_prenex_123 2))) (= .cse7 (select main_~array~1 .cse7)))))) (.cse0 (= 4 (select main_~array~1 4))) (.cse3 (exists ((v_main_~i~1_159 Int)) (and (= (select main_~array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse4 (+ v_main_~i~1_159 1))) (= .cse4 (select main_~array~1 .cse4))) (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse5 (+ v_main_~i~1_159 2))) (= (select main_~array~1 .cse5) .cse5))))) (.cse1 (= 3 (select main_~array~1 3)))) (or (and (= 2 (select main_~array~1 2)) .cse0 (= main_~i~1 4) (= 1 (select main_~array~1 1)) (= (select main_~array~1 0) 0) .cse1) (< ~n~0 5) (and .cse0 .cse2 (= main_~i~1 3) .cse1) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and .cse0 (and .cse3 (= main_~i~1 1)) .cse1) (< 5 ~n~0) (and (= main_~i~1 0) .cse1 .cse0 .cse2) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (and .cse0 (and (= main_~i~1 2) .cse3) .cse1))) [2018-09-14 15:49:37,486 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 38 39) no Hoare annotation was computed. [2018-09-14 15:49:37,486 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-14 15:49:37,486 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-14 15:49:37,486 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:49:37,487 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-14 15:49:37,487 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-14 15:49:37,487 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:49:37,504 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,505 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,505 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,506 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,506 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,506 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,507 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,507 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,507 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,508 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,508 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,508 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,508 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,508 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,509 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,509 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,509 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,509 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,517 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,518 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,518 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,518 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,518 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,519 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,519 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,522 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,523 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,523 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,523 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,523 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,524 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,524 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,524 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,524 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,524 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,525 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,528 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,528 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,528 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,528 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,529 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,529 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,529 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,529 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,530 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,530 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,530 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,539 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,539 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,539 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,539 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,539 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,541 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,541 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,542 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,542 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,542 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,542 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,543 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,543 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,543 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,547 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,547 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,547 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,547 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,547 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,548 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,548 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:49:37 BoogieIcfgContainer [2018-09-14 15:49:37,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:49:37,558 INFO L168 Benchmark]: Toolchain (without parser) took 224271.13 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.4 GB in the end (delta: -956.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-14 15:49:37,558 INFO L168 Benchmark]: CDTParser took 0.22 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-14 15:49:37,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.14 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-14 15:49:37,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.80 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-14 15:49:37,564 INFO L168 Benchmark]: Boogie Preprocessor took 23.31 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-14 15:49:37,565 INFO L168 Benchmark]: RCFGBuilder took 610.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-09-14 15:49:37,565 INFO L168 Benchmark]: TraceAbstraction took 223234.36 ms. Allocated memory was 2.2 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -186.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-14 15:49:37,567 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.14 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 29.80 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 23.31 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 610.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223234.36 ms. Allocated memory was 2.2 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -186.6 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_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,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_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,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_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,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_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,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: (((((((!(0 == \old(array)[0]) || !(0 == \old(array)[4])) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3])) || ((i == rh + 1 && lh + 1 <= n) && lh + 1 == i)) || !(\old(array)[2] == 0)) || (lh + 2 <= i && i <= n)) || 5 < n) || n < 5 - InvariantResult [Line: 33]: Loop Invariant [2018-09-14 15:49:37,584 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,586 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,587 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,587 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,587 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,588 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,588 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,588 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,588 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,589 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,589 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,589 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,589 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,589 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,590 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,590 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,590 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,590 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,592 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,599 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,599 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,599 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,599 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,600 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-14 15:49:37,600 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,600 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,600 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,601 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-14 15:49:37,601 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,601 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,601 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,603 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,604 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,604 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,604 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-14 15:49:37,604 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] Derived loop invariant: ((((((((((((i == 4 && array == \old(array)) || n < 5) || ((((3 == array[3] && array == \old(array)) && i <= 2) && i + 2 == array[i + 2]) && 2 <= i)) || (((((i == 0 && 3 == array[3]) && (\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 <= i + 1 && v_main_~i~1_87 == array[v_main_~i~1_87]) && v_main_~i~1_87 + 1 == array[v_main_~i~1_87 + 1]) && 0 <= v_main_~i~1_87)) && 4 == array[4]) && array == \old(array)) && i + 2 == array[i + 2])) || ((((i + 1 == array[i + 1] && 4 == array[4]) && i == 1) && array == \old(array)) && i + 2 == array[i + 2])) || !(0 == \old(array)[0])) || ((4 == array[4] && array == \old(array)) && i == 3)) || !(\old(array)[2] == 0)) || !(0 == \old(array)[4])) || (((((3 == array[3] && (\exists v_main_~i~1_45 : int :: (v_main_~i~1_45 <= i + 1 && v_main_~i~1_45 == array[v_main_~i~1_45]) && 0 <= v_main_~i~1_45)) && i <= 1) && array[4] == 4) && (\exists main_~i~1 : int :: (((array[main_~i~1] == main_~i~1 && main_~i~1 <= 0) && 0 <= main_~i~1) && main_~i~1 + 2 == array[main_~i~1 + 2]) && main_~i~1 + 1 == array[main_~i~1 + 1])) && array == \old(array))) || 5 < n) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3]) - InvariantResult [Line: 38]: Loop Invariant [2018-09-14 15:49:37,606 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,606 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,606 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,606 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,607 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,607 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,607 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,607 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,608 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,609 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,609 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,612 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,612 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,612 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,612 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,612 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,613 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,613 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,613 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-14 15:49:37,613 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,614 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-14 15:49:37,615 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] Derived loop invariant: (((((((n < 5 || ((4 == array[4] && (\exists v_main_~i~1_159 : int :: (((array[v_main_~i~1_159] == v_main_~i~1_159 && v_main_~i~1_159 + 1 == array[v_main_~i~1_159 + 1]) && v_main_~i~1_159 <= 0) && 0 <= v_main_~i~1_159) && array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && 1 <= i) && 3 == array[3])) || !(0 == \old(array)[0])) || !(\old(array)[2] == 0)) || !(0 == \old(array)[4])) || 5 < n) || (((i == 0 && 3 == array[3]) && 4 == array[4]) && (\exists v_prenex_123 : int :: (((v_prenex_123 + 1 == array[v_prenex_123 + 1] && 0 <= v_prenex_123) && v_prenex_123 <= 0) && array[v_prenex_123] == v_prenex_123) && v_prenex_123 + 2 == array[v_prenex_123 + 2]))) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3]) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((!(\old(array)[2] == 0) || !(0 == \old(array)[4])) || (array == \old(array) && 0 == lh)) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3])) || (lh + 1 <= i && i <= n)) || n < 5) || !(0 == \old(array)[0])) || (i == rh + 1 && i <= n)) || 5 < n - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 223.0s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 63.7s AutomataDifference, 0.0s DeadEndRemovalTime, 61.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 727 SDtfs, 3289 SDslu, 5696 SDs, 0 SdLazy, 9202 SolverSat, 1818 SolverUnsat, 110 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7445 GetRequests, 6204 SyntacticMatches, 93 SemanticMatches, 1148 ConstructedPredicates, 1 IntricatePredicates, 4 DeprecatedPredicates, 39227 ImplicationChecksByTransitivity, 103.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred 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, 1845 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 78 PreInvPairs, 547 NumberOfFragments, 956 HoareAnnotationTreeSize, 78 FomulaSimplifications, 391409254 FormulaSimplificationTreeSizeReduction, 17.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 40757473 FormulaSimplificationTreeSizeReductionInter, 43.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 93.1s InterpolantComputationTime, 5100 NumberOfCodeBlocks, 4575 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 8310 ConstructedInterpolants, 701 QuantifiedInterpolants, 9752235 SizeOfPredicates, 180 NumberOfNonLiveVariables, 5074 ConjunctsInSsa, 709 ConjunctsInUnsatCore, 89 InterpolantComputations, 7 PerfectInterpolantSequences, 16493/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-14_15-49-37-621.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-14_15-49-37-621.csv Received shutdown request...