java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:02:58,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:02:58,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:02:58,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:02:58,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:02:58,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:02:58,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:02:58,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:02:58,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:02:58,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:02:58,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:02:58,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:02:58,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:02:58,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:02:58,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:02:58,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:02:58,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:02:58,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:02:58,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:02:58,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:02:58,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:02:58,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:02:58,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:02:58,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:02:58,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:02:58,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:02:58,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:02:58,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:02:58,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:02:58,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:02:58,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:02:58,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:02:58,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:02:58,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:02:58,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:02:58,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:02:58,446 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:02:58,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:02:58,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:02:58,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:02:58,474 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:02:58,475 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:02:58,478 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:02:58,478 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:02:58,478 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:02:58,478 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:02:58,478 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:02:58,479 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:02:58,479 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:02:58,479 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:02:58,479 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:02:58,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:02:58,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:02:58,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:02:58,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:02:58,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:02:58,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:02:58,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:02:58,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:02:58,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:02:58,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:02:58,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:02:58,485 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:02:58,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:02:58,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:02:58,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:02:58,486 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:02:58,486 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:02:58,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:02:58,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:02:58,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:02:58,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:02:58,555 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:02:58,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-27 09:02:58,624 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/68a6d44d3/731a1554c8f44e7b86f31ec91c67c358/FLAG170096831 [2018-10-27 09:02:59,071 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:02:59,071 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-27 09:02:59,077 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/68a6d44d3/731a1554c8f44e7b86f31ec91c67c358/FLAG170096831 [2018-10-27 09:02:59,092 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/68a6d44d3/731a1554c8f44e7b86f31ec91c67c358 [2018-10-27 09:02:59,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:02:59,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:02:59,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:02:59,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:02:59,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:02:59,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36832d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59, skipping insertion in model container [2018-10-27 09:02:59,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:02:59,146 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:02:59,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:02:59,331 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:02:59,355 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:02:59,376 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:02:59,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59 WrapperNode [2018-10-27 09:02:59,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:02:59,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:02:59,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:02:59,378 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:02:59,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:02:59,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:02:59,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:02:59,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:02:59,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... [2018-10-27 09:02:59,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:02:59,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:02:59,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:02:59,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:02:59,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:02:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:02:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:02:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:02:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:02:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:02:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:02:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:02:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:03:00,018 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:03:00,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:03:00 BoogieIcfgContainer [2018-10-27 09:03:00,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:03:00,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:03:00,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:03:00,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:03:00,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:02:59" (1/3) ... [2018-10-27 09:03:00,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757a296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:03:00, skipping insertion in model container [2018-10-27 09:03:00,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:59" (2/3) ... [2018-10-27 09:03:00,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757a296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:03:00, skipping insertion in model container [2018-10-27 09:03:00,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:03:00" (3/3) ... [2018-10-27 09:03:00,027 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-10-27 09:03:00,037 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:03:00,046 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:03:00,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:03:00,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:03:00,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:03:00,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:03:00,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:03:00,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:03:00,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:03:00,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:03:00,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:03:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-27 09:03:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 09:03:00,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:00,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:00,126 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:00,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 277130583, now seen corresponding path program 1 times [2018-10-27 09:03:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:00,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:03:00,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:03:00,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:03:00,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:03:00,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:03:00,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:03:00,304 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-10-27 09:03:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:00,327 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-10-27 09:03:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:03:00,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 09:03:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:00,339 INFO L225 Difference]: With dead ends: 56 [2018-10-27 09:03:00,339 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 09:03:00,343 INFO L605 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-10-27 09:03:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 09:03:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 09:03:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 09:03:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 09:03:00,387 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2018-10-27 09:03:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:00,388 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 09:03:00,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:03:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 09:03:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 09:03:00,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:00,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:00,390 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:00,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash -32556863, now seen corresponding path program 1 times [2018-10-27 09:03:00,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:00,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:00,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:00,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:03:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:03:00,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:03:00,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:03:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:03:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:03:00,766 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-10-27 09:03:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:00,941 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-10-27 09:03:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:03:00,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 09:03:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:00,943 INFO L225 Difference]: With dead ends: 48 [2018-10-27 09:03:00,943 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 09:03:00,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:03:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 09:03:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-10-27 09:03:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 09:03:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-27 09:03:00,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-10-27 09:03:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:00,952 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 09:03:00,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:03:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-27 09:03:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 09:03:00,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:00,953 INFO L375 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] [2018-10-27 09:03:00,954 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:00,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash 894306866, now seen corresponding path program 1 times [2018-10-27 09:03:00,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:01,449 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-10-27 09:03:01,658 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-10-27 09:03:01,970 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2018-10-27 09:03:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:02,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:02,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:02,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 09:03:02,359 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [35], [37], [41], [45], [50], [60], [63], [65], [71], [72], [73], [75] [2018-10-27 09:03:02,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:03:02,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:03:02,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:03:02,863 INFO L272 AbstractInterpreter]: Visited 22 different actions 70 times. Merged at 12 different actions 36 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 09:03:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:02,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:03:02,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:02,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:02,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:02,915 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:02,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:03,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-27 09:03:03,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:03,354 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 23 treesize of output 37 [2018-10-27 09:03:03,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:03,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:03,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:03:03,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 09:03:03,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 09:03:03,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:03,532 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:03,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 09:03:03,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:03,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:03,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:03,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 09:03:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:03,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:06,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-27 09:03:06,302 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-27 09:03:06,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,322 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-10-27 09:03:06,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:06,327 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,351 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-10-27 09:03:06,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:06,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:06,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 26 [2018-10-27 09:03:06,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:06,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:06,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:06,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 09:03:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-27 09:03:06,557 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:06,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 09:03:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 09:03:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=595, Unknown=1, NotChecked=0, Total=702 [2018-10-27 09:03:06,560 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 20 states. [2018-10-27 09:03:07,263 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-10-27 09:03:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:07,760 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2018-10-27 09:03:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 09:03:07,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-27 09:03:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:07,765 INFO L225 Difference]: With dead ends: 76 [2018-10-27 09:03:07,766 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 09:03:07,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=240, Invalid=1091, Unknown=1, NotChecked=0, Total=1332 [2018-10-27 09:03:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 09:03:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2018-10-27 09:03:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 09:03:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-10-27 09:03:07,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 23 [2018-10-27 09:03:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:07,784 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-10-27 09:03:07,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 09:03:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-10-27 09:03:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 09:03:07,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:07,786 INFO L375 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] [2018-10-27 09:03:07,786 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:07,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash 307500852, now seen corresponding path program 1 times [2018-10-27 09:03:07,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:07,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:03:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:03:07,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:03:07,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:03:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:03:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:03:07,964 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2018-10-27 09:03:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:08,021 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-10-27 09:03:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:03:08,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 09:03:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:08,026 INFO L225 Difference]: With dead ends: 90 [2018-10-27 09:03:08,026 INFO L226 Difference]: Without dead ends: 53 [2018-10-27 09:03:08,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:03:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-27 09:03:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-10-27 09:03:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 09:03:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-10-27 09:03:08,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2018-10-27 09:03:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:08,038 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-10-27 09:03:08,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:03:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-10-27 09:03:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 09:03:08,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:08,039 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:08,040 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:08,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash 692568650, now seen corresponding path program 1 times [2018-10-27 09:03:08,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:08,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:08,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:08,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:08,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-27 09:03:08,821 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [35], [37], [41], [45], [50], [60], [63], [65], [71], [72], [73], [75] [2018-10-27 09:03:08,823 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:03:08,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:03:08,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:03:08,998 INFO L272 AbstractInterpreter]: Visited 24 different actions 84 times. Merged at 14 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 5 different actions. Largest state had 39 variables. [2018-10-27 09:03:09,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:09,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:03:09,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:09,028 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:09,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:09,046 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:09,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:09,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 09:03:09,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:09,248 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 36 treesize of output 53 [2018-10-27 09:03:09,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-27 09:03:09,352 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:09,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-27 09:03:09,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:09,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:09,383 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 54 treesize of output 61 [2018-10-27 09:03:09,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:03:09,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-27 09:03:09,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-27 09:03:09,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:09,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 09:03:09,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:09,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 09:03:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:09,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:12,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-27 09:03:12,229 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,232 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 62 treesize of output 69 [2018-10-27 09:03:12,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,313 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,333 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 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-27 09:03:12,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:12,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 83 [2018-10-27 09:03:12,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:12,387 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,389 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:12,393 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 09:03:12,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,483 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-27 09:03:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:14,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:14,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2018-10-27 09:03:14,628 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:14,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 09:03:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 09:03:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=707, Unknown=2, NotChecked=0, Total=812 [2018-10-27 09:03:14,630 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 20 states. [2018-10-27 09:03:15,456 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-10-27 09:03:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:15,987 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2018-10-27 09:03:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 09:03:15,988 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-10-27 09:03:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:15,990 INFO L225 Difference]: With dead ends: 121 [2018-10-27 09:03:15,990 INFO L226 Difference]: Without dead ends: 84 [2018-10-27 09:03:15,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=245, Invalid=1393, Unknown=2, NotChecked=0, Total=1640 [2018-10-27 09:03:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-27 09:03:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2018-10-27 09:03:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 09:03:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-10-27 09:03:16,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2018-10-27 09:03:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:16,002 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-10-27 09:03:16,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 09:03:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-10-27 09:03:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:03:16,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:16,004 INFO L375 BasicCegarLoop]: trace histogram [2, 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-10-27 09:03:16,004 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:16,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1150796076, now seen corresponding path program 1 times [2018-10-27 09:03:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:16,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:16,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:16,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:16,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:16,188 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 09:03:16,188 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [35], [37], [41], [45], [50], [52], [54], [60], [63], [65], [68], [70], [71], [72], [73], [75], [76] [2018-10-27 09:03:16,190 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:03:16,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:03:16,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:03:16,333 INFO L272 AbstractInterpreter]: Visited 27 different actions 112 times. Merged at 15 different actions 52 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-27 09:03:16,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:16,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:03:16,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:16,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:16,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:16,377 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:16,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:16,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:18,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:18,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-10-27 09:03:18,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:18,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:03:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:03:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-10-27 09:03:18,913 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 9 states. [2018-10-27 09:03:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:19,152 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-10-27 09:03:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:03:19,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-10-27 09:03:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:19,153 INFO L225 Difference]: With dead ends: 69 [2018-10-27 09:03:19,153 INFO L226 Difference]: Without dead ends: 46 [2018-10-27 09:03:19,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-10-27 09:03:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-27 09:03:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-10-27 09:03:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 09:03:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-27 09:03:19,160 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2018-10-27 09:03:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:19,160 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-27 09:03:19,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:03:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-10-27 09:03:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 09:03:19,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:19,162 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:19,162 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:19,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1621042525, now seen corresponding path program 2 times [2018-10-27 09:03:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:19,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:19,788 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2018-10-27 09:03:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:20,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:20,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:20,093 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:20,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:20,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:20,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:03:20,101 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:20,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:03:20,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:20,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:20,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 09:03:20,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:20,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-27 09:03:20,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-10-27 09:03:20,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-10-27 09:03:20,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:20,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:20,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:20,522 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 46 [2018-10-27 09:03:20,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2018-10-27 09:03:20,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 09:03:20,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-10-27 09:03:20,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:03:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:20,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:23,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-10-27 09:03:23,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,079 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 43 treesize of output 50 [2018-10-27 09:03:23,264 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 09:03:23,268 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,270 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,273 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,274 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,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, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-10-27 09:03:23,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:23,299 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:03:23,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:23,302 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,304 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,304 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,306 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,306 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,326 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-27 09:03:23,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:23,334 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-10-27 09:03:23,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:23,356 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,358 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,358 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,360 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,381 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 2 case distinctions, treesize of input 42 treesize of output 81 [2018-10-27 09:03:23,385 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:23,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:23,413 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 2 case distinctions, treesize of input 46 treesize of output 83 [2018-10-27 09:03:23,417 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:23,419 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:03:23,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:23,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:03:23,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:03:23,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:03:23,560 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-27 09:03:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:25,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 34 [2018-10-27 09:03:25,899 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:25,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 09:03:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 09:03:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=976, Unknown=2, NotChecked=0, Total=1122 [2018-10-27 09:03:25,902 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 20 states. [2018-10-27 09:03:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:26,888 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-10-27 09:03:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 09:03:26,889 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-27 09:03:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:26,891 INFO L225 Difference]: With dead ends: 116 [2018-10-27 09:03:26,891 INFO L226 Difference]: Without dead ends: 96 [2018-10-27 09:03:26,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=343, Invalid=1817, Unknown=2, NotChecked=0, Total=2162 [2018-10-27 09:03:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-27 09:03:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-10-27 09:03:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 09:03:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-10-27 09:03:26,903 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 31 [2018-10-27 09:03:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:26,904 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-10-27 09:03:26,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 09:03:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-10-27 09:03:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 09:03:26,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:26,906 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:26,906 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:26,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash -693836487, now seen corresponding path program 1 times [2018-10-27 09:03:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:26,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:26,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:27,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:27,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:27,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-27 09:03:27,597 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [35], [37], [41], [45], [50], [60], [63], [65], [71], [72], [73], [75] [2018-10-27 09:03:27,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:03:27,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:03:27,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:03:27,681 INFO L272 AbstractInterpreter]: Visited 23 different actions 63 times. Merged at 13 different actions 30 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-27 09:03:27,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:27,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:03:27,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:27,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:27,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:27,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:27,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:27,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-27 09:03:28,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:28,004 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 23 treesize of output 37 [2018-10-27 09:03:28,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:03:28,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 09:03:28,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 09:03:28,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:28,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:28,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 09:03:28,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 09:03:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:28,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:28,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-27 09:03:28,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,404 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,405 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,415 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-10-27 09:03:28,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:28,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 26 [2018-10-27 09:03:28,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:28,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:28,471 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-10-27 09:03:28,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:28,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:03:28,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:03:28,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:10 [2018-10-27 09:03:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:28,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:28,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2018-10-27 09:03:28,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:28,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 09:03:28,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 09:03:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2018-10-27 09:03:28,644 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 24 states. [2018-10-27 09:03:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:30,551 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2018-10-27 09:03:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 09:03:30,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-10-27 09:03:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:30,553 INFO L225 Difference]: With dead ends: 181 [2018-10-27 09:03:30,553 INFO L226 Difference]: Without dead ends: 161 [2018-10-27 09:03:30,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=643, Invalid=3389, Unknown=0, NotChecked=0, Total=4032 [2018-10-27 09:03:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-27 09:03:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 92. [2018-10-27 09:03:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-27 09:03:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2018-10-27 09:03:30,568 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 35 [2018-10-27 09:03:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:30,569 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2018-10-27 09:03:30,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 09:03:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2018-10-27 09:03:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 09:03:30,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:30,570 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:30,570 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:30,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1601373509, now seen corresponding path program 2 times [2018-10-27 09:03:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:30,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:30,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:30,797 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 09:03:31,270 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-27 09:03:31,848 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-27 09:03:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:32,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:32,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:32,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:32,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:32,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:32,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:03:32,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:32,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:03:32,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:32,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:32,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 09:03:32,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,476 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 36 treesize of output 53 [2018-10-27 09:03:32,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-27 09:03:32,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-27 09:03:32,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,557 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 53 treesize of output 58 [2018-10-27 09:03:32,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-27 09:03:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 09:03:32,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 53 [2018-10-27 09:03:32,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:19 [2018-10-27 09:03:32,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-27 09:03:32,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:32,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 09:03:32,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:32,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 09:03:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:32,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:37,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2018-10-27 09:03:37,443 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 75 [2018-10-27 09:03:37,458 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,460 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,461 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,461 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 72 [2018-10-27 09:03:37,575 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,622 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,623 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,623 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,645 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 2 case distinctions, treesize of input 47 treesize of output 83 [2018-10-27 09:03:37,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:37,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,760 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,769 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:37,872 INFO L303 Elim1Store]: Index analysis took 224 ms [2018-10-27 09:03:38,047 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 2 case distinctions, treesize of input 43 treesize of output 81 [2018-10-27 09:03:38,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,180 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-10-27 09:03:38,193 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 2 case distinctions, treesize of input 38 treesize of output 55 [2018-10-27 09:03:38,195 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 09:03:38,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,202 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,202 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,213 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,223 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 83 [2018-10-27 09:03:38,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,228 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,228 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,233 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,243 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,256 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 84 [2018-10-27 09:03:38,258 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,263 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:03:38,263 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:38,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,270 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,272 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:38,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, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2018-10-27 09:03:38,296 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:03:38,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:03:38,534 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:87, output treesize:46 [2018-10-27 09:03:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:40,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:40,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 37 [2018-10-27 09:03:40,669 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:40,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:03:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:03:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1181, Unknown=3, NotChecked=0, Total=1332 [2018-10-27 09:03:40,671 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 23 states. [2018-10-27 09:03:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:41,501 INFO L93 Difference]: Finished difference Result 141 states and 168 transitions. [2018-10-27 09:03:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 09:03:41,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-10-27 09:03:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:41,504 INFO L225 Difference]: With dead ends: 141 [2018-10-27 09:03:41,504 INFO L226 Difference]: Without dead ends: 120 [2018-10-27 09:03:41,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=232, Invalid=1657, Unknown=3, NotChecked=0, Total=1892 [2018-10-27 09:03:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-27 09:03:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2018-10-27 09:03:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-27 09:03:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2018-10-27 09:03:41,516 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 35 [2018-10-27 09:03:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:41,516 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2018-10-27 09:03:41,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:03:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2018-10-27 09:03:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 09:03:41,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:41,518 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 09:03:41,519 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:41,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:41,519 INFO L82 PathProgramCache]: Analyzing trace with hash 99245443, now seen corresponding path program 2 times [2018-10-27 09:03:41,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:41,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:41,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:41,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:41,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:42,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:42,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:42,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:42,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:42,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:42,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:03:42,144 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:42,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:03:42,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:42,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:42,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 09:03:42,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:42,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-27 09:03:42,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 09:03:42,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 09:03:42,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-10-27 09:03:42,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:03:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:42,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:42,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-10-27 09:03:42,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,906 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,918 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 58 [2018-10-27 09:03:42,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:42,949 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 24 [2018-10-27 09:03:42,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,963 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,967 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,969 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:42,980 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 56 [2018-10-27 09:03:42,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:43,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:43,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:43,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:5 [2018-10-27 09:03:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:43,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:43,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 13] total 35 [2018-10-27 09:03:43,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:43,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 09:03:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 09:03:43,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 09:03:43,059 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 32 states. [2018-10-27 09:03:53,679 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-10-27 09:04:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:00,498 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2018-10-27 09:04:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 09:04:00,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 09:04:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:00,500 INFO L225 Difference]: With dead ends: 145 [2018-10-27 09:04:00,501 INFO L226 Difference]: Without dead ends: 143 [2018-10-27 09:04:00,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 09:04:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-27 09:04:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 105. [2018-10-27 09:04:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-27 09:04:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2018-10-27 09:04:00,515 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 40 [2018-10-27 09:04:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:00,516 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2018-10-27 09:04:00,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 09:04:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2018-10-27 09:04:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 09:04:00,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:00,518 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:00,518 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:00,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1042006481, now seen corresponding path program 3 times [2018-10-27 09:04:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:00,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:04:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:00,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:00,755 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 09:04:01,010 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 09:04:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:01,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:01,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:01,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:04:01,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:04:01,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:01,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:04:01,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:04:01,580 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:04:01,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:04:01,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:04:01,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:01,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 09:04:01,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:01,794 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 36 treesize of output 53 [2018-10-27 09:04:01,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:01,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:01,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:01,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:44 [2018-10-27 09:04:01,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:01,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-27 09:04:01,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:01,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:01,972 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 54 treesize of output 61 [2018-10-27 09:04:01,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:01,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:01,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:04:01,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-27 09:04:02,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-27 09:04:02,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:02,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 09:04:02,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 09:04:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:04:02,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:04,167 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_write~int_#value_17| Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) |v_main_write~int_#value_17|))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))) (< c_main_~key~0 |v_main_write~int_#value_17|))) is different from false [2018-10-27 09:04:05,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-27 09:04:05,382 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,383 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 62 treesize of output 69 [2018-10-27 09:04:05,457 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:05,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:05,460 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,462 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,462 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,466 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,468 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,484 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 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-27 09:04:05,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:05,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,501 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,501 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,519 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 1 case distinctions, treesize of input 50 treesize of output 78 [2018-10-27 09:04:05,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:05,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:05,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:05,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:05,564 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-27 09:04:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2018-10-27 09:04:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 12] total 34 [2018-10-27 09:04:05,626 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:05,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 09:04:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 09:04:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=935, Unknown=1, NotChecked=62, Total=1122 [2018-10-27 09:04:05,627 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 25 states. [2018-10-27 09:04:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:07,926 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2018-10-27 09:04:07,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 09:04:07,927 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-10-27 09:04:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:07,930 INFO L225 Difference]: With dead ends: 235 [2018-10-27 09:04:07,930 INFO L226 Difference]: Without dead ends: 195 [2018-10-27 09:04:07,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=556, Invalid=3737, Unknown=1, NotChecked=128, Total=4422 [2018-10-27 09:04:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-27 09:04:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2018-10-27 09:04:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 09:04:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2018-10-27 09:04:07,947 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 39 [2018-10-27 09:04:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:07,947 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2018-10-27 09:04:07,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 09:04:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2018-10-27 09:04:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 09:04:07,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:07,949 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:07,949 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:07,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1926599722, now seen corresponding path program 2 times [2018-10-27 09:04:07,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:07,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:07,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:04:07,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:07,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:08,910 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-10-27 09:04:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:09,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:09,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:09,023 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:04:09,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:04:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:09,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:04:09,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:04:09,036 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:04:09,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:04:09,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:04:09,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:09,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 09:04:09,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,130 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 19 treesize of output 29 [2018-10-27 09:04:09,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:04:09,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-27 09:04:09,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 09:04:09,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 43 [2018-10-27 09:04:09,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:24 [2018-10-27 09:04:09,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 09:04:09,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,280 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 20 treesize of output 43 [2018-10-27 09:04:09,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:24 [2018-10-27 09:04:09,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 09:04:09,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:09,403 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 20 treesize of output 43 [2018-10-27 09:04:09,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:19 [2018-10-27 09:04:09,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 09:04:09,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-10-27 09:04:09,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:09,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:04:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:09,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:14,215 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 09:04:16,387 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 09:04:19,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-10-27 09:04:19,138 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,139 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 49 treesize of output 56 [2018-10-27 09:04:19,143 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,175 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 4 case distinctions, treesize of input 44 treesize of output 79 [2018-10-27 09:04:19,410 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-27 09:04:19,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,415 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,415 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,424 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 0 case distinctions, treesize of input 53 treesize of output 66 [2018-10-27 09:04:19,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,437 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-10-27 09:04:19,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,460 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,463 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2018-10-27 09:04:19,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,475 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:19,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,484 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 39 treesize of output 39 [2018-10-27 09:04:19,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,486 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:19,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,491 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,491 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 64 [2018-10-27 09:04:19,501 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:19,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,662 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 111 [2018-10-27 09:04:19,707 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 15 xjuncts. [2018-10-27 09:04:19,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,725 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 80 [2018-10-27 09:04:19,760 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 16 xjuncts. [2018-10-27 09:04:19,971 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,977 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,991 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 67 [2018-10-27 09:04:19,992 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:19,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,999 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2018-10-27 09:04:20,000 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:20,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:04:20,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:04:20,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:04:20,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:04:20,106 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:74, output treesize:43 [2018-10-27 09:04:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:20,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:20,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 39 [2018-10-27 09:04:20,232 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:20,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 09:04:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 09:04:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1291, Unknown=2, NotChecked=0, Total=1482 [2018-10-27 09:04:20,233 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 21 states. [2018-10-27 09:04:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:21,299 INFO L93 Difference]: Finished difference Result 280 states and 343 transitions. [2018-10-27 09:04:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 09:04:21,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-10-27 09:04:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:21,303 INFO L225 Difference]: With dead ends: 280 [2018-10-27 09:04:21,303 INFO L226 Difference]: Without dead ends: 228 [2018-10-27 09:04:21,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 54 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=377, Invalid=2171, Unknown=2, NotChecked=0, Total=2550 [2018-10-27 09:04:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-27 09:04:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2018-10-27 09:04:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 09:04:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2018-10-27 09:04:21,320 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 43 [2018-10-27 09:04:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:21,320 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2018-10-27 09:04:21,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 09:04:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2018-10-27 09:04:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 09:04:21,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:21,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:21,322 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:21,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1130767443, now seen corresponding path program 1 times [2018-10-27 09:04:21,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:21,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:21,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:04:21,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:21,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:21,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:21,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:21,783 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-27 09:04:21,784 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [35], [37], [41], [45], [50], [52], [54], [60], [63], [65], [68], [70], [71], [72], [73], [75], [76] [2018-10-27 09:04:21,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:04:21,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:04:21,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:04:21,929 INFO L272 AbstractInterpreter]: Visited 28 different actions 100 times. Merged at 16 different actions 44 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 40 variables. [2018-10-27 09:04:21,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:21,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:04:21,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:21,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:04:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:21,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:04:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:22,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:22,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 09:04:22,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:22,134 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 27 treesize of output 38 [2018-10-27 09:04:22,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:22,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:22,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:22,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-27 09:04:22,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:22,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-10-27 09:04:22,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:22,253 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:22,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:22,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-10-27 09:04:22,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:22,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:22,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:04:22,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2018-10-27 09:04:26,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-27 09:04:26,743 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:26,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:26,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:26,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:26,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:26,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-10-27 09:04:26,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:26,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:26,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:26,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-27 09:04:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:26,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:33,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-10-27 09:04:33,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,823 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 66 treesize of output 73 [2018-10-27 09:04:33,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,926 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,934 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-10-27 09:04:33,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:33,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,940 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,940 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,947 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,948 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-10-27 09:04:33,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:33,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,955 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,955 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,956 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,957 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,959 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 57 [2018-10-27 09:04:33,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:33,963 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,964 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-10-27 09:04:33,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:33,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,996 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,996 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:33,998 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,004 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,004 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-10-27 09:04:34,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:34,009 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,010 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,010 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,012 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,026 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 1 case distinctions, treesize of input 59 treesize of output 89 [2018-10-27 09:04:34,028 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:34,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,031 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:34,035 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-10-27 09:04:34,036 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:34,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:34,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:34,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:34,109 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31 [2018-10-27 09:04:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:34,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:34,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 15] total 37 [2018-10-27 09:04:34,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:34,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 09:04:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 09:04:34,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1195, Unknown=3, NotChecked=0, Total=1332 [2018-10-27 09:04:34,196 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand 27 states. [2018-10-27 09:05:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:05:17,280 INFO L93 Difference]: Finished difference Result 252 states and 304 transitions. [2018-10-27 09:05:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 09:05:17,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-10-27 09:05:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:05:17,284 INFO L225 Difference]: With dead ends: 252 [2018-10-27 09:05:17,284 INFO L226 Difference]: Without dead ends: 200 [2018-10-27 09:05:17,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=314, Invalid=2543, Unknown=5, NotChecked=0, Total=2862 [2018-10-27 09:05:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-27 09:05:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2018-10-27 09:05:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 09:05:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 178 transitions. [2018-10-27 09:05:17,302 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 178 transitions. Word has length 44 [2018-10-27 09:05:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:05:17,303 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 178 transitions. [2018-10-27 09:05:17,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 09:05:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 178 transitions. [2018-10-27 09:05:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 09:05:17,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:05:17,304 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:05:17,305 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:05:17,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:05:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 596360874, now seen corresponding path program 3 times [2018-10-27 09:05:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:05:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:05:17,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:05:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:05:17,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:05:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:05:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:05:17,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:05:17,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:05:17,864 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:05:17,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:05:17,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:05:17,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:05:17,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:05:17,872 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:05:17,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:05:17,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:05:17,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:05:17,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:05:17,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:05:17,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:17,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:17,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:17,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2018-10-27 09:05:18,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-27 09:05:18,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:18,097 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 24 treesize of output 39 [2018-10-27 09:05:18,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-27 09:05:18,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 09:05:18,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:18,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:18,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:18,373 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 20 treesize of output 43 [2018-10-27 09:05:18,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:19 [2018-10-27 09:05:18,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 09:05:18,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-10-27 09:05:18,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:18,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:05:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:05:18,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:05:32,303 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 09:05:32,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 74 [2018-10-27 09:05:32,365 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 74 [2018-10-27 09:05:32,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:05:32,419 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 60 treesize of output 59 [2018-10-27 09:05:32,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:32,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-10-27 09:05:32,564 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,622 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-27 09:05:32,644 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 3 case distinctions, treesize of input 48 treesize of output 65 [2018-10-27 09:05:32,799 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-27 09:05:32,803 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,803 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,857 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 2 case distinctions, treesize of input 50 treesize of output 93 [2018-10-27 09:05:32,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:32,862 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,863 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 95 [2018-10-27 09:05:32,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:32,897 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:32,897 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:32,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,928 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 2 case distinctions, treesize of input 54 treesize of output 95 [2018-10-27 09:05:32,931 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:32,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2018-10-27 09:05:32,956 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:32,960 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,960 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,963 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,964 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,988 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 93 [2018-10-27 09:05:32,990 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:32,993 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,994 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,998 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:32,998 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 96 [2018-10-27 09:05:33,024 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:33,210 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,218 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,223 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 121 [2018-10-27 09:05:33,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:33,292 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 39 xjuncts. [2018-10-27 09:05:33,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:33,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 91 [2018-10-27 09:05:33,356 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 32 xjuncts. [2018-10-27 09:05:33,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-27 09:05:33,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:05:34,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-10-27 09:05:34,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-10-27 09:05:34,018 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:34,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,070 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 3 case distinctions, treesize of input 48 treesize of output 65 [2018-10-27 09:05:34,223 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-27 09:05:34,227 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,238 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,238 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 124 [2018-10-27 09:05:34,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:34,308 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 39 xjuncts. [2018-10-27 09:05:34,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,336 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,344 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 126 [2018-10-27 09:05:34,400 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:34,412 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 39 xjuncts. [2018-10-27 09:05:34,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 126 [2018-10-27 09:05:34,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:34,521 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 39 xjuncts. [2018-10-27 09:05:34,539 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:34,539 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:34,565 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,625 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,839 INFO L303 Elim1Store]: Index analysis took 298 ms [2018-10-27 09:05:34,875 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 6 case distinctions, treesize of input 46 treesize of output 124 [2018-10-27 09:05:34,875 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:34,885 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 39 xjuncts. [2018-10-27 09:05:34,887 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:34,887 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:34,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:34,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 91 [2018-10-27 09:05:34,956 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 32 xjuncts. [2018-10-27 09:05:36,662 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,667 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,690 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 2 case distinctions, treesize of input 45 treesize of output 90 [2018-10-27 09:05:36,692 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:36,697 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:36,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 68 [2018-10-27 09:05:36,717 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:36,945 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-27 09:05:37,127 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,130 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 45 treesize of output 53 [2018-10-27 09:05:37,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,207 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,237 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 2 case distinctions, treesize of input 46 treesize of output 83 [2018-10-27 09:05:37,239 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:37,242 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,243 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,247 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,270 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-27 09:05:37,272 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:37,274 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:37,274 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:37,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,278 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,306 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 2 case distinctions, treesize of input 42 treesize of output 81 [2018-10-27 09:05:37,308 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:37,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-10-27 09:05:37,356 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:37,359 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:37,359 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:37,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 56 [2018-10-27 09:05:37,390 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:37,483 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:05:37,673 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 09:05:37,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 09:05:37,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 59 [2018-10-27 09:05:37,939 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 9 treesize of output 13 [2018-10-27 09:05:37,939 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:37,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-10-27 09:05:37,957 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:37,959 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 43 treesize of output 51 [2018-10-27 09:05:38,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 59 [2018-10-27 09:05:38,049 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,051 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:38,052 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:38,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,059 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,059 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,060 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,083 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 83 [2018-10-27 09:05:38,085 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,088 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:38,088 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:38,090 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,091 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,093 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,118 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 2 case distinctions, treesize of input 41 treesize of output 83 [2018-10-27 09:05:38,120 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,123 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,123 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,127 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,149 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 85 [2018-10-27 09:05:38,151 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,154 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,154 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:38,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 85 [2018-10-27 09:05:38,184 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,285 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,316 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,347 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:05:38,482 INFO L202 ElimStorePlain]: Needed 46 recursive calls to eliminate 8 variables, input treesize:86, output treesize:42 [2018-10-27 09:05:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:05:38,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:05:38,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 39 [2018-10-27 09:05:38,604 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:05:38,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 09:05:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 09:05:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1317, Unknown=5, NotChecked=0, Total=1482 [2018-10-27 09:05:38,606 INFO L87 Difference]: Start difference. First operand 148 states and 178 transitions. Second operand 24 states. [2018-10-27 09:05:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:05:39,905 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2018-10-27 09:05:39,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 09:05:39,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-10-27 09:05:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:05:39,909 INFO L225 Difference]: With dead ends: 303 [2018-10-27 09:05:39,909 INFO L226 Difference]: Without dead ends: 220 [2018-10-27 09:05:39,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=350, Invalid=2297, Unknown=5, NotChecked=0, Total=2652 [2018-10-27 09:05:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-27 09:05:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 160. [2018-10-27 09:05:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-27 09:05:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2018-10-27 09:05:39,926 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 43 [2018-10-27 09:05:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:05:39,927 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2018-10-27 09:05:39,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 09:05:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2018-10-27 09:05:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 09:05:39,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:05:39,928 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:05:39,928 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:05:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:05:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1833906732, now seen corresponding path program 4 times [2018-10-27 09:05:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:05:39,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:05:39,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:05:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:05:39,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:05:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:05:40,148 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 09:05:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:05:40,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:05:40,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:05:40,806 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:05:40,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:05:40,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:05:40,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:05:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:05:40,815 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:05:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:05:40,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:05:40,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 09:05:41,007 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 13 treesize of output 12 [2018-10-27 09:05:41,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 09:05:41,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-27 09:05:41,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:05:41,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:31 [2018-10-27 09:05:41,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-27 09:05:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-27 09:05:41,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 09:05:41,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-10-27 09:05:41,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 09:05:41,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 85 [2018-10-27 09:05:41,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 09:05:41,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2018-10-27 09:05:41,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 09:05:41,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:41,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 85 [2018-10-27 09:05:41,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:41,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 09:05:41,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:35 [2018-10-27 09:05:42,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-27 09:05:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:42,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:42,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:05:42,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:05:42,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-10-27 09:05:42,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:42,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:42,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:42,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-10-27 09:05:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:05:42,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:06:45,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-10-27 09:06:45,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 55 treesize of output 51 [2018-10-27 09:06:45,182 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2018-10-27 09:06:45,228 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 84 [2018-10-27 09:06:45,899 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 165 [2018-10-27 09:06:45,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:45,911 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:45,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:45,926 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:45,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:45,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 116 [2018-10-27 09:06:45,971 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:45,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:46,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,015 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,027 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 116 [2018-10-27 09:06:46,078 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:46,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:46,154 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,155 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,176 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 117 [2018-10-27 09:06:46,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:46,218 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:46,227 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,228 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,229 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 118 [2018-10-27 09:06:46,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:46,291 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:46,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 76 [2018-10-27 09:06:46,347 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-10-27 09:06:46,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 80 [2018-10-27 09:06:46,425 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-10-27 09:06:46,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,436 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:46,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:06:46,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 118 [2018-10-27 09:06:46,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:46,504 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:48,080 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,080 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 09:06:48,093 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:48,100 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 [2018-10-27 09:06:48,122 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-10-27 09:06:48,200 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:48,225 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-10-27 09:06:48,245 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 107 [2018-10-27 09:06:48,248 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 6 xjuncts. [2018-10-27 09:06:49,783 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,786 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,786 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,794 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,818 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 102 [2018-10-27 09:06:49,820 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 6 xjuncts. [2018-10-27 09:06:49,824 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 [2018-10-27 09:06:49,847 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-27 09:06:49,850 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,850 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:49,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 54 [2018-10-27 09:06:49,865 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:51,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 52 [2018-10-27 09:06:51,194 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:51,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,199 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,201 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,209 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 67 [2018-10-27 09:06:51,210 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:51,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2018-10-27 09:06:51,225 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:51,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 90 [2018-10-27 09:06:51,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:06:51,792 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 64 xjuncts. [2018-10-27 09:06:51,801 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,802 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 135 [2018-10-27 09:06:51,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 09:06:51,900 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 116 xjuncts. [2018-10-27 09:06:51,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 89 [2018-10-27 09:06:51,955 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 32 xjuncts. [2018-10-27 09:06:51,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:51,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:52,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 137 [2018-10-27 09:06:52,053 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 09:06:52,080 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 116 xjuncts. [2018-10-27 09:06:56,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 7 dim-1 vars, End of recursive call: and 28 xjuncts. [2018-10-27 09:06:57,142 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-10-27 09:06:57,304 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-10-27 09:06:57,308 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 32 [2018-10-27 09:06:57,311 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 09:06:57,321 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,325 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,333 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 65 [2018-10-27 09:06:57,334 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,338 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 64 [2018-10-27 09:06:57,352 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,361 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 62 [2018-10-27 09:06:57,369 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,372 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,376 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 62 [2018-10-27 09:06:57,385 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 64 [2018-10-27 09:06:57,403 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 50 [2018-10-27 09:06:57,415 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-27 09:06:57,571 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-10-27 09:06:57,591 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-10-27 09:06:57,599 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,599 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,606 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:06:57,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 84 [2018-10-27 09:06:57,636 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 11 xjuncts. [2018-10-27 09:06:57,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2018-10-27 09:06:57,665 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-10-27 09:06:57,857 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:06:58,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-10-27 09:06:58,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 09:06:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 09:06:59,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 18 xjuncts. [2018-10-27 09:06:59,297 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 9 variables, input treesize:106, output treesize:292 [2018-10-27 09:07:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 18 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:07:19,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:07:19,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 52 [2018-10-27 09:07:19,186 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:07:19,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-27 09:07:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 09:07:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2310, Unknown=37, NotChecked=0, Total=2652 [2018-10-27 09:07:19,189 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand 35 states. [2018-10-27 09:07:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:07:21,155 INFO L93 Difference]: Finished difference Result 287 states and 344 transitions. [2018-10-27 09:07:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 09:07:21,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2018-10-27 09:07:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:07:21,160 INFO L225 Difference]: With dead ends: 287 [2018-10-27 09:07:21,160 INFO L226 Difference]: Without dead ends: 232 [2018-10-27 09:07:21,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=729, Invalid=4204, Unknown=37, NotChecked=0, Total=4970 [2018-10-27 09:07:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-27 09:07:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 172. [2018-10-27 09:07:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-27 09:07:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2018-10-27 09:07:21,179 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 43 [2018-10-27 09:07:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:07:21,179 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2018-10-27 09:07:21,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-27 09:07:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2018-10-27 09:07:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 09:07:21,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:07:21,180 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:07:21,180 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:07:21,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:07:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash -181004637, now seen corresponding path program 3 times [2018-10-27 09:07:21,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:07:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:07:21,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:07:21,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:07:21,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:07:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:07:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:07:21,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:07:21,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:07:21,683 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:07:21,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:07:21,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:07:21,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:07:21,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:07:21,699 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:07:21,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:07:21,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:07:21,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:07:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:07:21,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:07:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:07:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:07:22,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-10-27 09:07:22,029 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:07:22,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 09:07:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 09:07:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-10-27 09:07:22,030 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand 11 states. [2018-10-27 09:07:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:07:22,186 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2018-10-27 09:07:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:07:22,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-10-27 09:07:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:07:22,188 INFO L225 Difference]: With dead ends: 259 [2018-10-27 09:07:22,188 INFO L226 Difference]: Without dead ends: 235 [2018-10-27 09:07:22,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-10-27 09:07:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-27 09:07:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 186. [2018-10-27 09:07:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-27 09:07:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2018-10-27 09:07:22,210 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 49 [2018-10-27 09:07:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:07:22,210 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2018-10-27 09:07:22,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 09:07:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2018-10-27 09:07:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 09:07:22,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:07:22,212 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 09:07:22,212 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:07:22,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:07:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 238443826, now seen corresponding path program 4 times [2018-10-27 09:07:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:07:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:07:22,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:07:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:07:22,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:07:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:07:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:07:22,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:07:22,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:07:22,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:07:22,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:07:22,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:07:22,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:07:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:07:22,844 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:07:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:07:22,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:07:22,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-27 09:07:22,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:07:22,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-27 09:07:22,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:07:22,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:07:22,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:07:22,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-10-27 09:07:23,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 09:07:23,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:07:23,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:07:23,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:07:23,028 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 24 treesize of output 55 [2018-10-27 09:07:23,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:07:23,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:07:23,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:07:23,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:19 [2018-10-27 09:07:25,067 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#v~0.base_BEFORE_CALL_5| Int) (|v_main_~#v~0.offset_BEFORE_CALL_5| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#v~0.base_BEFORE_CALL_5|))) (<= (select .cse0 (+ |v_main_~#v~0.offset_BEFORE_CALL_5| 4)) (select .cse0 (- (+ (* (- 1) |v_main_~#v~0.offset_BEFORE_CALL_5|) (- 8))))))) is different from true Received shutdown request... [2018-10-27 09:07:29,096 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-10-27 09:07:29,096 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 09:07:29,297 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:07:29,297 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 09:07:29,304 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 09:07:29,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:07:29 BoogieIcfgContainer [2018-10-27 09:07:29,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:07:29,305 INFO L168 Benchmark]: Toolchain (without parser) took 270200.57 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 972.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -663.2 MB). Peak memory consumption was 308.8 MB. Max. memory is 7.1 GB. [2018-10-27 09:07:29,306 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:07:29,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.76 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-10-27 09:07:29,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.63 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-10-27 09:07:29,307 INFO L168 Benchmark]: Boogie Preprocessor took 28.30 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-10-27 09:07:29,307 INFO L168 Benchmark]: RCFGBuilder took 569.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-27 09:07:29,307 INFO L168 Benchmark]: TraceAbstraction took 269284.82 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 213.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.6 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. [2018-10-27 09:07:29,309 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.63 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 28.30 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 569.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 269284.82 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 213.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.6 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. TIMEOUT Result, 269.2s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 74.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 566 SDtfs, 1509 SDslu, 4573 SDs, 0 SdLazy, 5349 SolverSat, 909 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 60.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 704 SyntacticMatches, 83 SemanticMatches, 599 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 8202 ImplicationChecksByTransitivity, 167.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 639 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 184.7s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1462 ConstructedInterpolants, 185 QuantifiedInterpolants, 794313 SizeOfPredicates, 384 NumberOfNonLiveVariables, 2416 ConjunctsInSsa, 662 ConjunctsInUnsatCore, 42 InterpolantComputations, 3 PerfectInterpolantSequences, 111/896 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown