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.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:00:27,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:00:27,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:00:27,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:00:27,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:00:27,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:00:27,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:00:27,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:00:27,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:00:27,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:00:27,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:00:27,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:00:27,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:00:27,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:00:27,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:00:27,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:00:27,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:00:27,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:00:27,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:00:27,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:00:27,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:00:27,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:00:27,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:00:27,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:00:27,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:00:27,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:00:27,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:00:27,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:00:27,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:00:27,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:00:27,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:00:27,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:00:27,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:00:27,475 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:00:27,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:00:27,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:00:27,477 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 04:00:27,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:00:27,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:00:27,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:00:27,510 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:00:27,510 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:00:27,511 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:00:27,511 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:00:27,511 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:00:27,511 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 04:00:27,511 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:00:27,512 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:00:27,512 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:00:27,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:00:27,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:00:27,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:00:27,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 04:00:27,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:00:27,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 04:00:27,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 04:00:27,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 04:00:27,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:00:27,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:00:27,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:00:27,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:00:27,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:00:27,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:00:27,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:00:27,516 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 04:00:27,517 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:00:27,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:00:27,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:00:27,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 04:00:27,517 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 04:00:27,518 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 04:00:27,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:00:27,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:00:27,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:00:27,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:00:27,591 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:00:27,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 04:00:27,664 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4425456/2531922d1deb4ddaa3020b54425f9b1b/FLAGd84cc02a6 [2018-10-27 04:00:28,075 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:00:28,076 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 04:00:28,082 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4425456/2531922d1deb4ddaa3020b54425f9b1b/FLAGd84cc02a6 [2018-10-27 04:00:28,098 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4425456/2531922d1deb4ddaa3020b54425f9b1b [2018-10-27 04:00:28,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:00:28,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:00:28,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:00:28,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:00:28,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:00:28,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ac8833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28, skipping insertion in model container [2018-10-27 04:00:28,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:00:28,152 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:00:28,344 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:00:28,348 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:00:28,373 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:00:28,398 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:00:28,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28 WrapperNode [2018-10-27 04:00:28,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:00:28,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:00:28,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:00:28,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:00:28,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:00:28,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:00:28,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:00:28,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:00:28,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (1/1) ... [2018-10-27 04:00:28,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:00:28,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:00:28,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:00:28,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:00:28,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (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 04:00:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:00:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:00:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:00:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:00:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:00:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:00:28,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 04:00:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 04:00:29,078 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:00:29,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:00:29 BoogieIcfgContainer [2018-10-27 04:00:29,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:00:29,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:00:29,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:00:29,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:00:29,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:00:28" (1/3) ... [2018-10-27 04:00:29,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b6a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:00:29, skipping insertion in model container [2018-10-27 04:00:29,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:00:28" (2/3) ... [2018-10-27 04:00:29,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b6a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:00:29, skipping insertion in model container [2018-10-27 04:00:29,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:00:29" (3/3) ... [2018-10-27 04:00:29,087 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-27 04:00:29,097 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:00:29,105 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 04:00:29,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 04:00:29,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:00:29,156 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 04:00:29,156 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:00:29,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:00:29,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:00:29,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:00:29,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:00:29,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:00:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-27 04:00:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:00:29,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:29,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:00:29,185 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:29,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-10-27 04:00:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:29,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:29,351 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 04:00:29,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:00:29,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:00:29,354 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:00:29,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:00:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:00:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:00:29,375 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-10-27 04:00:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:29,399 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-10-27 04:00:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:00:29,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 04:00:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:29,410 INFO L225 Difference]: With dead ends: 60 [2018-10-27 04:00:29,410 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 04:00:29,414 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 04:00:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 04:00:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 04:00:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 04:00:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-27 04:00:29,458 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-10-27 04:00:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:29,458 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 04:00:29,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:00:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-10-27 04:00:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:00:29,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:29,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:00:29,463 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:29,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-10-27 04:00:29,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:29,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:29,802 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 04:00:29,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:00:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:00:29,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:00:29,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:00:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:00:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:00:29,806 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-10-27 04:00:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:30,021 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-10-27 04:00:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:00:30,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 04:00:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:30,024 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:00:30,024 INFO L226 Difference]: Without dead ends: 38 [2018-10-27 04:00:30,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:00:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-27 04:00:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-10-27 04:00:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 04:00:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-27 04:00:30,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-10-27 04:00:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:30,037 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-27 04:00:30,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:00:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-27 04:00:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 04:00:30,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:30,039 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 04:00:30,039 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:30,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-10-27 04:00:30,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:30,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:30,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:30,520 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-27 04:00:30,782 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 16 [2018-10-27 04:00:30,964 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-27 04:00:31,156 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2018-10-27 04:00:31,629 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 04:00:31,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:31,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:31,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 04:00:31,632 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 04:00:31,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:00:31,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:00:31,805 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:00:33,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:00:33,577 INFO L272 AbstractInterpreter]: Visited 22 different actions 166 times. Merged at 12 different actions 108 times. Widened at 3 different actions 15 times. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 04:00:33,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:33,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:00:33,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:33,636 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 04:00:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:33,651 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:00:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:33,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:34,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 28 treesize of output 23 [2018-10-27 04:00:34,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:34,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, 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 04:00:34,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:34,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:34,391 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 04:00:34,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 04:00:34,569 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 04:00:34,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:34,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:34,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:34,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:34,600 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 04:00:34,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:34,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:34,654 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 04:00:34,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 04:00:34,776 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 04:00:34,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:00:35,224 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 04:00:35,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,302 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 04:00:35,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:00:35,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,318 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 04:00:35,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:00:35,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:35,325 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 04:00:35,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:35,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:35,379 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 04:00:35,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 04:00:35,466 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 04:00:35,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:00:35,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-27 04:00:35,489 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:00:35,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:00:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:00:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:00:35,492 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-10-27 04:00:35,925 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-27 04:00:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:36,762 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-10-27 04:00:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:00:36,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-27 04:00:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:36,766 INFO L225 Difference]: With dead ends: 99 [2018-10-27 04:00:36,766 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 04:00:36,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 04:00:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 04:00:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2018-10-27 04:00:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 04:00:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-27 04:00:36,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 23 [2018-10-27 04:00:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:36,781 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-27 04:00:36,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:00:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-27 04:00:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 04:00:36,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:36,782 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 04:00:36,782 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1303070050, now seen corresponding path program 1 times [2018-10-27 04:00:36,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:36,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:36,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:36,848 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 04:00:36,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:00:36,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:00:36,849 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:00:36,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:00:36,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:00:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:00:36,850 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 5 states. [2018-10-27 04:00:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:36,945 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2018-10-27 04:00:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:00:36,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 04:00:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:36,949 INFO L225 Difference]: With dead ends: 137 [2018-10-27 04:00:36,949 INFO L226 Difference]: Without dead ends: 90 [2018-10-27 04:00:36,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:00:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-27 04:00:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-10-27 04:00:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 04:00:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-27 04:00:36,961 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2018-10-27 04:00:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:36,962 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-27 04:00:36,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:00:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-10-27 04:00:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:00:36,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:36,963 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, 1, 1] [2018-10-27 04:00:36,964 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:36,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-10-27 04:00:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:36,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:36,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:36,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:36,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:37,626 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 04:00:37,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:37,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:37,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 04:00:37,627 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 04:00:37,629 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:00:37,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:00:37,635 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:00:40,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:00:40,936 INFO L272 AbstractInterpreter]: Visited 26 different actions 410 times. Merged at 16 different actions 286 times. Widened at 4 different actions 29 times. Found 60 fixpoints after 7 different actions. Largest state had 39 variables. [2018-10-27 04:00:40,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:40,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:00:40,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:40,957 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 04:00:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:40,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:00:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:41,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:41,208 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 41 treesize of output 34 [2018-10-27 04:00:41,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:41,216 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 34 treesize of output 50 [2018-10-27 04:00:41,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,240 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 04:00:41,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-10-27 04:00:41,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:41,348 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 04:00:41,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:41,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:41,382 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 04:00:41,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,425 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 04:00:41,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2018-10-27 04:00:41,466 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 04:00:41,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:41,479 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 04:00:41,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:41,484 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 04:00:41,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 04:00:41,525 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 04:00:41,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:00:46,202 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 04:00:46,223 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,227 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 04:00:46,313 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,327 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,336 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,370 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,374 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,385 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 04:00:46,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:00:46,395 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,399 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,423 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 04:00:46,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:46,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:46,435 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 04:00:46,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:46,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:46,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:46,484 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 04:00:46,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-27 04:00:46,577 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 04:00:46,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:00:46,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2018-10-27 04:00:46,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:00:46,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:00:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:00:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=985, Unknown=1, NotChecked=0, Total=1122 [2018-10-27 04:00:46,601 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 22 states. [2018-10-27 04:00:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:47,430 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-10-27 04:00:47,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 04:00:47,430 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-10-27 04:00:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:47,432 INFO L225 Difference]: With dead ends: 152 [2018-10-27 04:00:47,432 INFO L226 Difference]: Without dead ends: 150 [2018-10-27 04:00:47,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=217, Invalid=1422, Unknown=1, NotChecked=0, Total=1640 [2018-10-27 04:00:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-27 04:00:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 75. [2018-10-27 04:00:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 04:00:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-10-27 04:00:47,446 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 29 [2018-10-27 04:00:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:47,446 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-10-27 04:00:47,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:00:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-10-27 04:00:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:00:47,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:47,448 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 04:00:47,448 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:47,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-10-27 04:00:47,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:47,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:47,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:47,672 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 04:00:47,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:47,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:47,673 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 04:00:47,674 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 04:00:47,676 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:00:47,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:00:47,681 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:00:49,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:00:49,148 INFO L272 AbstractInterpreter]: Visited 27 different actions 370 times. Merged at 15 different actions 196 times. Widened at 4 different actions 28 times. Found 11 fixpoints after 2 different actions. Largest state had 39 variables. [2018-10-27 04:00:49,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:49,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:00:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:49,186 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 04:00:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:49,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:00:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:49,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:49,330 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 04:00:49,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:00:51,977 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 04:00:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:00:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-27 04:00:51,999 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:00:51,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:00:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:00:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2018-10-27 04:00:52,000 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 8 states. [2018-10-27 04:00:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:52,162 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-10-27 04:00:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:00:52,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-27 04:00:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:52,164 INFO L225 Difference]: With dead ends: 142 [2018-10-27 04:00:52,165 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 04:00:52,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=49, Invalid=132, Unknown=1, NotChecked=0, Total=182 [2018-10-27 04:00:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 04:00:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2018-10-27 04:00:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 04:00:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-27 04:00:52,180 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 32 [2018-10-27 04:00:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:52,181 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-27 04:00:52,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:00:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-27 04:00:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:00:52,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:52,182 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 04:00:52,182 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:52,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-10-27 04:00:52,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:52,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:53,069 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-10-27 04:00:53,283 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 04:00:53,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:53,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:53,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:00:53,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:00:53,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:53,284 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 04:00:53,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:00:53,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:00:53,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:00:53,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:00:53,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:53,502 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 04:00:53,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:53,507 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 04:00:53,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,533 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 04:00:53,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-10-27 04:00:53,621 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 25 treesize of output 18 [2018-10-27 04:00:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:53,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:53,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:53,631 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 18 treesize of output 37 [2018-10-27 04:00:53,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,649 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 04:00:53,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-27 04:00:53,686 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 04:00:53,689 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 04:00:53,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:53,692 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 04:00:53,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 04:00:53,708 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 04:00:53,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:00:56,358 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 04:00:56,361 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,363 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 04:00:56,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,436 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,439 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,460 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 04:00:56,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:56,467 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:00:56,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:56,469 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,471 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,471 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,474 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,474 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,494 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 04:00:56,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:56,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,520 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 04:00:56,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:56,567 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,603 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,612 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,661 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,673 INFO L303 Elim1Store]: Index analysis took 149 ms [2018-10-27 04:00:56,685 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 04:00:56,688 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:56,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,695 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,696 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:56,716 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 04:00:56,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 04:00:56,729 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:00:56,729 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:56,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:00:56,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:00:56,854 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 04:00:56,855 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-27 04:00:57,103 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 04:00:57,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:00:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2018-10-27 04:00:57,124 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:00:57,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:00:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:00:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2018-10-27 04:00:57,126 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 20 states. [2018-10-27 04:00:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:58,208 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-10-27 04:00:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:00:58,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-27 04:00:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:58,211 INFO L225 Difference]: With dead ends: 194 [2018-10-27 04:00:58,212 INFO L226 Difference]: Without dead ends: 141 [2018-10-27 04:00:58,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-10-27 04:00:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-27 04:00:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2018-10-27 04:00:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 04:00:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-10-27 04:00:58,227 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 31 [2018-10-27 04:00:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:58,228 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-10-27 04:00:58,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:00:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-10-27 04:00:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:00:58,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:58,230 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:00:58,230 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:58,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash 982712326, now seen corresponding path program 2 times [2018-10-27 04:00:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:58,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:00:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:58,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:00:58,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:58,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:58,303 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:00:58,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:00:58,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:58,304 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 04:00:58,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:00:58,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:00:58,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:00:58,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:00:58,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:58,486 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 41 treesize of output 34 [2018-10-27 04:00:58,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,495 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 34 treesize of output 50 [2018-10-27 04:00:58,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,518 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 04:00:58,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-27 04:00:58,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,688 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 04:00:58,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,696 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 04:00:58,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,766 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 04:00:58,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-27 04:00:58,838 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 36 treesize of output 28 [2018-10-27 04:00:58,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,842 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:58,843 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:00:58,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:00:58,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:00:58,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:00:58,859 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 04:00:58,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:5 [2018-10-27 04:00:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:00:58,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:03,308 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 04:01:05,498 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 04:01:05,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,504 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 04:01:05,613 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-27 04:01:05,618 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,618 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,619 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,621 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,634 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 04:01:05,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:05,637 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:01:05,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:05,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,640 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,640 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,643 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:05,659 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 04:01:05,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:05,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:05,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:05,698 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 04:01:05,698 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-27 04:01:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:01:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 31 [2018-10-27 04:01:07,776 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:07,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 04:01:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 04:01:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=813, Unknown=3, NotChecked=0, Total=930 [2018-10-27 04:01:07,777 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 19 states. [2018-10-27 04:01:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:09,228 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2018-10-27 04:01:09,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 04:01:09,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-10-27 04:01:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:09,229 INFO L225 Difference]: With dead ends: 213 [2018-10-27 04:01:09,230 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 04:01:09,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=393, Invalid=2466, Unknown=3, NotChecked=0, Total=2862 [2018-10-27 04:01:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 04:01:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-10-27 04:01:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 04:01:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-27 04:01:09,243 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 35 [2018-10-27 04:01:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:09,243 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-27 04:01:09,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 04:01:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-10-27 04:01:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:01:09,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:09,245 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, 1, 1] [2018-10-27 04:01:09,245 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:09,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-10-27 04:01:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:09,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:01:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:09,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:09,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:09,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:09,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 04:01:09,731 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 04:01:09,733 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:01:09,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:01:09,737 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:01:11,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:01:11,462 INFO L272 AbstractInterpreter]: Visited 25 different actions 278 times. Merged at 15 different actions 197 times. Widened at 4 different actions 27 times. Found 18 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-27 04:01:11,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:11,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:01:11,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:11,474 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 04:01:11,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:11,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:01:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:11,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:11,700 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 04:01:11,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:11,709 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 04:01:11,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:11,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:11,728 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 04:01:11,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 04:01:11,785 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 04:01:11,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:11,788 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:11,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:11,789 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:11,794 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 04:01:11,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:11,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:11,807 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 04:01:11,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 04:01:11,821 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 04:01:11,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:13,977 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 04:01:14,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,040 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 04:01:14,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:14,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,058 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 04:01:14,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:14,063 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,065 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,065 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:14,074 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 04:01:14,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:14,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:14,430 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 04:01:14,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 04:01:15,084 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 04:01:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2018-10-27 04:01:15,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:15,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:01:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:01:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=747, Unknown=1, NotChecked=0, Total=870 [2018-10-27 04:01:15,108 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 23 states. [2018-10-27 04:01:16,034 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-27 04:01:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:16,896 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-10-27 04:01:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 04:01:16,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-10-27 04:01:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:16,899 INFO L225 Difference]: With dead ends: 190 [2018-10-27 04:01:16,899 INFO L226 Difference]: Without dead ends: 147 [2018-10-27 04:01:16,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=558, Invalid=2303, Unknown=1, NotChecked=0, Total=2862 [2018-10-27 04:01:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-27 04:01:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2018-10-27 04:01:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:01:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 04:01:16,911 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2018-10-27 04:01:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:16,912 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 04:01:16,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:01:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 04:01:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:01:16,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:16,914 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, 1, 1] [2018-10-27 04:01:16,914 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:16,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-10-27 04:01:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:16,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:17,921 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 04:01:17,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:17,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:17,921 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:01:17,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:01:17,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:17,922 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 04:01:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:01:17,930 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:01:17,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:01:17,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:01:17,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:18,098 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 04:01:18,101 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 04:01:18,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,144 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 04:01:18,147 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 04:01:18,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-10-27 04:01:18,332 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 30 treesize of output 25 [2018-10-27 04:01:18,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,337 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 25 treesize of output 51 [2018-10-27 04:01:18,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,362 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 04:01:18,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-27 04:01:18,413 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 22 [2018-10-27 04:01:18,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,422 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 22 treesize of output 61 [2018-10-27 04:01:18,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,479 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 04:01:18,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-10-27 04:01:18,552 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 04:01:18,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:18,591 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 04:01:18,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:18,626 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 04:01:18,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 04:01:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:18,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:39,862 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 51 treesize of output 47 [2018-10-27 04:01:39,866 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 47 treesize of output 43 [2018-10-27 04:01:39,881 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:39,885 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 04:01:39,993 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:39,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,001 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,003 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2018-10-27 04:01:40,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,049 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,053 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,065 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 35 treesize of output 46 [2018-10-27 04:01:40,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:40,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,080 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,179 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 3 case distinctions, treesize of input 47 treesize of output 85 [2018-10-27 04:01:40,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 85 [2018-10-27 04:01:40,229 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,231 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,273 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 3 case distinctions, treesize of input 43 treesize of output 83 [2018-10-27 04:01:40,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,337 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,390 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 2 case distinctions, treesize of input 38 treesize of output 52 [2018-10-27 04:01:40,391 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 04:01:40,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:40,422 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 41 treesize of output 83 [2018-10-27 04:01:40,424 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:01:40,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:01:40,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:01:40,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:01:40,805 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:77, output treesize:104 [2018-10-27 04:01:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:52,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:52,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-10-27 04:01:52,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:52,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:01:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:01:52,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1493, Unknown=15, NotChecked=0, Total=1722 [2018-10-27 04:01:52,735 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 26 states. [2018-10-27 04:01:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:53,565 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2018-10-27 04:01:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:01:53,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-10-27 04:01:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:53,567 INFO L225 Difference]: With dead ends: 119 [2018-10-27 04:01:53,567 INFO L226 Difference]: Without dead ends: 117 [2018-10-27 04:01:53,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=307, Invalid=2030, Unknown=15, NotChecked=0, Total=2352 [2018-10-27 04:01:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-27 04:01:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2018-10-27 04:01:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 04:01:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-27 04:01:53,582 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-10-27 04:01:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:53,583 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-27 04:01:53,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:01:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-10-27 04:01:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 04:01:53,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:53,584 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 04:01:53,585 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:53,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-10-27 04:01:53,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:53,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:01:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:53,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:54,000 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 04:01:54,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:54,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:54,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:01:54,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:01:54,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:54,001 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 04:01:54,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:01:54,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:01:54,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:01:54,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:01:54,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:54,242 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 04:01:54,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:01:54,246 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 04:01:54,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:54,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:54,262 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 04:01:54,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-27 04:01:54,540 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 04:01:54,543 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 04:01:54,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:54,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:54,552 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 04:01:54,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 04:01:54,603 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 04:01:54,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:56,996 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 04:01:57,003 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 45 treesize of output 39 [2018-10-27 04:01:57,051 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,053 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 04:01:57,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:01:57,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,058 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,059 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,068 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 37 treesize of output 52 [2018-10-27 04:01:57,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:57,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:01:57,082 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 52 [2018-10-27 04:01:57,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:01:57,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:01:57,107 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 04:01:57,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:22 [2018-10-27 04:01:57,338 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 04:01:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 43 [2018-10-27 04:01:57,361 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:57,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 04:01:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 04:01:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 04:01:57,363 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 32 states. [2018-10-27 04:02:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:10,628 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-27 04:02:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 04:02:10,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 04:02:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:10,629 INFO L225 Difference]: With dead ends: 136 [2018-10-27 04:02:10,629 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 04:02:10,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=400, Invalid=2680, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 04:02:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 04:02:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-10-27 04:02:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 04:02:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-27 04:02:10,644 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2018-10-27 04:02:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:10,644 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 04:02:10,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 04:02:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-27 04:02:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 04:02:10,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:10,645 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:10,646 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:10,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1027358850, now seen corresponding path program 3 times [2018-10-27 04:02:10,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:10,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:10,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:10,979 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 04:02:11,384 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 10 [2018-10-27 04:02:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:11,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:11,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:11,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:11,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:11,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:11,910 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 04:02:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:02:11,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:02:11,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:02:11,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:11,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:12,057 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 04:02:12,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,062 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 04:02:12,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,137 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 04:02:12,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 04:02:12,207 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 22 [2018-10-27 04:02:12,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-10-27 04:02:12,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,232 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 04:02:12,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 04:02:12,289 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 25 treesize of output 18 [2018-10-27 04:02:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,300 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 18 treesize of output 37 [2018-10-27 04:02:12,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,321 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 04:02:12,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:13 [2018-10-27 04:02:12,362 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 30 treesize of output 22 [2018-10-27 04:02:12,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:12,366 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 22 treesize of output 16 [2018-10-27 04:02:12,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:12,373 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 04:02:12,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-10-27 04:02:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:12,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:05,972 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 63 treesize of output 57 [2018-10-27 04:03:05,976 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:05,978 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 57 treesize of output 64 [2018-10-27 04:03:05,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,012 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 52 treesize of output 92 [2018-10-27 04:03:06,435 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-10-27 04:03:06,447 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 95 [2018-10-27 04:03:06,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:06,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,508 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 43 treesize of output 56 [2018-10-27 04:03:06,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:06,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,518 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,519 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 95 [2018-10-27 04:03:06,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:06,558 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,559 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,559 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,563 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 40 treesize of output 50 [2018-10-27 04:03:06,564 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:06,566 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,572 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,606 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 4 case distinctions, treesize of input 46 treesize of output 97 [2018-10-27 04:03:06,612 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:06,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,635 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,635 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,636 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,648 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 47 treesize of output 83 [2018-10-27 04:03:06,650 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:06,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,658 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:06,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 04:03:06,702 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:07,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,165 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,175 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,240 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 49 treesize of output 142 [2018-10-27 04:03:07,241 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:07,259 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 39 xjuncts. [2018-10-27 04:03:07,296 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,339 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 43 treesize of output 98 [2018-10-27 04:03:07,346 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-10-27 04:03:07,349 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:07,390 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 43 treesize of output 97 [2018-10-27 04:03:07,395 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-10-27 04:03:08,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,607 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,608 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 99 [2018-10-27 04:03:08,643 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:08,648 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,665 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 44 treesize of output 59 [2018-10-27 04:03:08,667 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:08,669 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,688 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 34 treesize of output 51 [2018-10-27 04:03:08,689 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:08,695 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,701 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:08,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 04:03:08,736 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:09,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 04:03:09,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:03:09,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:03:09,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-10-27 04:03:09,547 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:76, output treesize:145 [2018-10-27 04:03:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:09,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2018-10-27 04:03:09,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:09,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 04:03:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 04:03:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1339, Unknown=26, NotChecked=0, Total=1560 [2018-10-27 04:03:09,660 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 28 states. [2018-10-27 04:03:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:03:10,968 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-10-27 04:03:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 04:03:10,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-10-27 04:03:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:03:10,971 INFO L225 Difference]: With dead ends: 202 [2018-10-27 04:03:10,971 INFO L226 Difference]: Without dead ends: 157 [2018-10-27 04:03:10,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=419, Invalid=2525, Unknown=26, NotChecked=0, Total=2970 [2018-10-27 04:03:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-27 04:03:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2018-10-27 04:03:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 04:03:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-10-27 04:03:10,992 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-10-27 04:03:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:03:10,992 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-10-27 04:03:10,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 04:03:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-10-27 04:03:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:03:10,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:03:10,994 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, 1, 1] [2018-10-27 04:03:10,994 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:03:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-10-27 04:03:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:03:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:10,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:03:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:10,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:03:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:11,602 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-27 04:03:12,496 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 04:03:12,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:12,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:12,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-27 04:03:12,497 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 04:03:12,499 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:03:12,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:03:12,504 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:03:13,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:03:13,637 INFO L272 AbstractInterpreter]: Visited 25 different actions 269 times. Merged at 15 different actions 191 times. Widened at 4 different actions 24 times. Found 17 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 04:03:13,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:13,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:03:13,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:13,679 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 04:03:13,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:13,692 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:03:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:13,930 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 04:03:13,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:13,933 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 04:03:13,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:13,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:13,952 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 04:03:13,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-27 04:03:14,094 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 32 treesize of output 25 [2018-10-27 04:03:14,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-27 04:03:14,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,127 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 04:03:14,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-10-27 04:03:14,235 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 32 treesize of output 25 [2018-10-27 04:03:14,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-27 04:03:14,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:03:14,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-27 04:03:14,315 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 04:03:14,317 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:14,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:14,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:14,327 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 49 [2018-10-27 04:03:14,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:14,339 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 04:03:14,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 04:03:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:03:14,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:15,021 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 04:03:15,025 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,026 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 04:03:15,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,062 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 04:03:15,313 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-27 04:03:15,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,325 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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 04:03:15,386 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:15,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 39 xjuncts. [2018-10-27 04:03:15,399 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:03:15,399 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:15,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,406 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,410 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,415 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,469 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 04:03:15,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:15,480 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 39 xjuncts. [2018-10-27 04:03:15,501 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:03:15,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:15,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,521 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,523 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,527 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,528 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,582 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 04:03:15,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:15,596 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 39 xjuncts. [2018-10-27 04:03:15,600 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:03:15,600 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:15,606 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,609 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,617 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,618 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:15,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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 04:03:15,666 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:15,676 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 39 xjuncts. [2018-10-27 04:03:16,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:16,914 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:16,915 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:16,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 92 [2018-10-27 04:03:16,950 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:17,121 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:17,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:17,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:17,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 97 [2018-10-27 04:03:17,179 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-27 04:03:17,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:03:17,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:03:17,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:03:17,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:03:17,473 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:76, output treesize:57 [2018-10-27 04:03:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:17,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:17,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 46 [2018-10-27 04:03:17,699 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:17,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:03:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:03:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1837, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 04:03:17,701 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 31 states. [2018-10-27 04:03:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:03:20,564 INFO L93 Difference]: Finished difference Result 278 states and 325 transitions. [2018-10-27 04:03:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 04:03:20,565 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-27 04:03:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:03:20,567 INFO L225 Difference]: With dead ends: 278 [2018-10-27 04:03:20,568 INFO L226 Difference]: Without dead ends: 233 [2018-10-27 04:03:20,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=694, Invalid=4562, Unknown=0, NotChecked=0, Total=5256 [2018-10-27 04:03:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-27 04:03:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 140. [2018-10-27 04:03:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-27 04:03:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-10-27 04:03:20,592 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 45 [2018-10-27 04:03:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:03:20,593 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-10-27 04:03:20,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:03:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-10-27 04:03:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:03:20,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:03:20,594 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, 1, 1] [2018-10-27 04:03:20,594 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:03:20,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-10-27 04:03:20,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:03:20,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:20,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:20,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:20,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:03:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:21,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:21,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:21,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-27 04:03:21,201 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 04:03:21,203 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:03:21,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:03:21,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:03:23,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:03:23,145 INFO L272 AbstractInterpreter]: Visited 30 different actions 444 times. Merged at 18 different actions 273 times. Widened at 5 different actions 37 times. Found 30 fixpoints after 6 different actions. Largest state had 40 variables. [2018-10-27 04:03:23,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:23,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:03:23,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:23,187 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 04:03:23,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:23,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:03:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:23,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:23,391 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 41 treesize of output 34 [2018-10-27 04:03:23,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:23,397 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 34 treesize of output 50 [2018-10-27 04:03:23,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:23,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:23,418 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 04:03:23,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-27 04:03:23,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-27 04:03:23,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:23,882 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:23,883 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:23,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:23,889 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 52 treesize of output 86 [2018-10-27 04:03:23,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:23,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:23,918 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 04:03:23,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:37 [2018-10-27 04:03:24,334 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 65 treesize of output 61 [2018-10-27 04:03:24,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:24,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,342 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:24,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,346 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 57 treesize of output 78 [2018-10-27 04:03:24,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:24,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,382 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 29 treesize of output 33 [2018-10-27 04:03:24,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:24,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:24,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:24,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:24,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 150 [2018-10-27 04:03:24,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:24,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:24,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:24,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:91, output treesize:5 [2018-10-27 04:03:24,619 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 04:03:24,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:25,183 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 04:03:25,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,188 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 04:03:25,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,267 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,267 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,268 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,268 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,274 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,275 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,277 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 04:03:25,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,285 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,294 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 04:03:25,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,303 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 47 treesize of output 51 [2018-10-27 04:03:25,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,308 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,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, 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 04:03:25,327 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:25,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,333 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,333 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,342 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 04:03:25,343 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,346 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,346 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,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, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-10-27 04:03:25,352 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,356 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,356 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,358 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:25,369 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 04:03:25,370 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:25,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:25,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:25,452 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 04:03:25,452 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-10-27 04:03:25,568 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 04:03:25,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:25,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 17] total 49 [2018-10-27 04:03:25,590 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:25,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-27 04:03:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 04:03:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2126, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 04:03:25,594 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 36 states. [2018-10-27 04:03:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:03:28,239 INFO L93 Difference]: Finished difference Result 279 states and 329 transitions. [2018-10-27 04:03:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 04:03:28,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-10-27 04:03:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:03:28,243 INFO L225 Difference]: With dead ends: 279 [2018-10-27 04:03:28,244 INFO L226 Difference]: Without dead ends: 234 [2018-10-27 04:03:28,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=607, Invalid=5093, Unknown=0, NotChecked=0, Total=5700 [2018-10-27 04:03:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-27 04:03:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 181. [2018-10-27 04:03:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-27 04:03:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-10-27 04:03:28,279 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 46 [2018-10-27 04:03:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:03:28,279 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-10-27 04:03:28,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-27 04:03:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-10-27 04:03:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:03:28,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:03:28,282 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, 1, 1] [2018-10-27 04:03:28,282 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:03:28,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1700799956, now seen corresponding path program 2 times [2018-10-27 04:03:28,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:03:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:28,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:28,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:03:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:28,650 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 04:03:28,851 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-10-27 04:03:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:29,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:29,365 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:29,365 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:03:29,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:03:29,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:29,365 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 04:03:29,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:03:29,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:03:29,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 04:03:29,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:03:29,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:29,614 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 04:03:29,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:29,620 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 04:03:29,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:29,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:29,637 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 04:03:29,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-27 04:03:29,809 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 46 treesize of output 37 [2018-10-27 04:03:29,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:29,816 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:29,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 80 [2018-10-27 04:03:29,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:29,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:29,873 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 04:03:29,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-27 04:03:29,940 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 32 treesize of output 24 [2018-10-27 04:03:29,964 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:29,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:29,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:29,971 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 24 treesize of output 32 [2018-10-27 04:03:29,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:29,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:29,983 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 04:03:29,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-27 04:03:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:03:30,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:30,504 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 93 treesize of output 83 [2018-10-27 04:03:30,530 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,534 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 61 treesize of output 68 [2018-10-27 04:03:30,603 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,605 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,610 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,612 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,624 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 32 treesize of output 68 [2018-10-27 04:03:30,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:30,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:30,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-10-27 04:03:30,718 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,722 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,727 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,766 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 32 treesize of output 73 [2018-10-27 04:03:30,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:30,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:30,829 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:30,854 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 3 case distinctions, treesize of input 110 treesize of output 113 [2018-10-27 04:03:31,090 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2018-10-27 04:03:31,093 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,096 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,096 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,096 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,111 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 49 treesize of output 81 [2018-10-27 04:03:31,112 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:31,115 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,117 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,119 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,119 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,120 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,133 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 47 treesize of output 83 [2018-10-27 04:03:31,134 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:31,213 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,240 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 37 treesize of output 78 [2018-10-27 04:03:31,242 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:31,244 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,247 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,248 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,249 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,249 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,253 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,254 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:31,262 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-10-27 04:03:31,264 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:31,300 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:31,316 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 04:03:31,317 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:98, output treesize:13 [2018-10-27 04:03:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:03:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:31,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 44 [2018-10-27 04:03:31,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:31,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:03:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:03:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 04:03:31,437 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 31 states. [2018-10-27 04:03:33,823 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-10-27 04:03:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:03:36,157 INFO L93 Difference]: Finished difference Result 430 states and 510 transitions. [2018-10-27 04:03:36,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-27 04:03:36,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-27 04:03:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:03:36,160 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:03:36,161 INFO L226 Difference]: Without dead ends: 385 [2018-10-27 04:03:36,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1663, Invalid=8639, Unknown=0, NotChecked=0, Total=10302 [2018-10-27 04:03:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-27 04:03:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 213. [2018-10-27 04:03:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-27 04:03:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2018-10-27 04:03:36,217 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 45 [2018-10-27 04:03:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:03:36,218 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2018-10-27 04:03:36,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:03:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2018-10-27 04:03:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:03:36,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:03:36,219 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, 1, 1] [2018-10-27 04:03:36,219 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:03:36,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash -390828650, now seen corresponding path program 4 times [2018-10-27 04:03:36,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:03:36,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:36,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:03:36,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:36,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:03:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:36,744 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 04:03:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:37,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:37,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:37,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:03:37,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:03:37,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:37,553 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 04:03:37,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:37,562 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:03:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:37,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:37,843 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 04:03:37,845 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 04:03:37,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:37,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:37,866 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 04:03:37,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-27 04:03:37,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:37,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:37,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:37,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:26 [2018-10-27 04:03:38,118 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 04:03:38,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,125 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 04:03:38,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,149 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 04:03:38,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-10-27 04:03:38,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 35 treesize of output 28 [2018-10-27 04:03:38,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,285 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 04:03:38,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,318 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 04:03:38,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2018-10-27 04:03:38,571 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 04:03:38,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,584 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 04:03:38,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,617 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 04:03:38,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:35 [2018-10-27 04:03:38,724 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 04:03:38,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,748 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:38,748 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:38,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:38,750 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 04:03:38,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:38,767 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 04:03:38,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-10-27 04:03:38,793 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 04:03:38,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:39,859 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 04:03:39,871 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 04:03:39,946 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 04:03:39,964 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 04:03:40,126 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-10-27 04:03:40,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,142 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 04:03:40,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,155 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 04:03:40,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,171 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 04:03:40,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,178 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,191 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 04:03:40,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,196 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,208 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 04:03:40,210 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,213 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,215 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 04:03:40,215 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:40,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,231 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 04:03:40,233 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:40,413 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 58 [2018-10-27 04:03:40,415 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-27 04:03:40,419 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,437 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 04:03:40,438 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:40,442 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:40,482 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 04:03:40,485 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 11 xjuncts. [2018-10-27 04:03:40,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:03:40,866 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 04:03:41,544 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 165 [2018-10-27 04:03:41,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,619 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 3 case distinctions, treesize of input 55 treesize of output 107 [2018-10-27 04:03:41,622 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:41,625 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,627 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,631 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,660 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 3 case distinctions, treesize of input 59 treesize of output 109 [2018-10-27 04:03:41,664 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:41,678 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,680 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,683 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,712 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 04:03:41,714 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:41,718 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,730 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 04:03:41,731 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:41,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,755 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 2 case distinctions, treesize of input 50 treesize of output 75 [2018-10-27 04:03:41,756 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:41,760 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,763 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,766 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 109 [2018-10-27 04:03:41,800 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:41,804 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:41,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 110 [2018-10-27 04:03:41,844 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:43,075 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,127 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 49 treesize of output 98 [2018-10-27 04:03:43,130 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 32 xjuncts. [2018-10-27 04:03:43,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,140 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,210 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 7 case distinctions, treesize of input 55 treesize of output 137 [2018-10-27 04:03:43,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-27 04:03:43,226 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 68 xjuncts. [2018-10-27 04:03:43,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,235 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:43,271 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 91 [2018-10-27 04:03:43,274 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 16 xjuncts. [2018-10-27 04:03:46,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,233 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 04:03:46,234 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 04:03:46,264 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 120 xjuncts. [2018-10-27 04:03:46,321 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 96 [2018-10-27 04:03:46,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:03:46,328 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 64 xjuncts. [2018-10-27 04:03:46,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,376 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 04:03:46,381 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-10-27 04:03:46,384 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:46,461 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 04:03:46,462 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 04:03:46,503 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 120 xjuncts. [2018-10-27 04:03:54,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,187 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,188 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,198 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 54 treesize of output 69 [2018-10-27 04:03:54,199 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:54,213 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 04:03:54,214 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:54,225 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 04:03:54,226 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:54,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:54,240 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 50 treesize of output 67 [2018-10-27 04:03:54,242 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:55,278 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 35 treesize of output 52 [2018-10-27 04:03:55,280 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 8 xjuncts. [2018-10-27 04:03:55,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 111 [2018-10-27 04:03:55,344 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 11 xjuncts. [2018-10-27 04:03:55,385 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:55,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 109 [2018-10-27 04:03:55,433 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 11 xjuncts. [2018-10-27 04:03:55,469 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 44 treesize of output 79 [2018-10-27 04:03:55,471 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 8 xjuncts. [2018-10-27 04:03:56,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:56,693 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 04:03:56,695 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-27 04:03:56,724 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 38 treesize of output 55 [2018-10-27 04:03:56,725 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-10-27 04:03:56,729 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:56,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:56,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:56,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:56,766 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 04:03:56,768 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 6 xjuncts. [2018-10-27 04:03:57,503 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 28 xjuncts. [2018-10-27 04:03:57,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-10-27 04:03:58,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 04:03:58,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 04:03:59,019 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 04:03:59,019 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 9 variables, input treesize:103, output treesize:259 [2018-10-27 04:03:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:59,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:59,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2018-10-27 04:03:59,404 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:59,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 04:03:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 04:03:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2834, Unknown=0, NotChecked=0, Total=3192 [2018-10-27 04:03:59,406 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand 38 states. [2018-10-27 04:04:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:01,367 INFO L93 Difference]: Finished difference Result 361 states and 434 transitions. [2018-10-27 04:04:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 04:04:01,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-10-27 04:04:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:01,371 INFO L225 Difference]: With dead ends: 361 [2018-10-27 04:04:01,371 INFO L226 Difference]: Without dead ends: 272 [2018-10-27 04:04:01,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=653, Invalid=4459, Unknown=0, NotChecked=0, Total=5112 [2018-10-27 04:04:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-27 04:04:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2018-10-27 04:04:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 04:04:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2018-10-27 04:04:01,422 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 45 [2018-10-27 04:04:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:01,422 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2018-10-27 04:04:01,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 04:04:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2018-10-27 04:04:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:04:01,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:01,424 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 04:04:01,424 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:01,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1905129809, now seen corresponding path program 3 times [2018-10-27 04:04:01,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:01,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:01,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:01,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:01,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:02,161 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 04:04:02,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:02,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:04:02,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:04:02,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:04:02,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:02,163 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 04:04:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:04:02,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:04:02,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:04:02,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:04:02,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:04:02,342 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 04:04:02,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:02,590 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 04:04:02,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:04:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-10-27 04:04:02,614 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:04:02,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:04:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:04:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:04:02,616 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand 13 states. [2018-10-27 04:04:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:03,045 INFO L93 Difference]: Finished difference Result 307 states and 369 transitions. [2018-10-27 04:04:03,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:04:03,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-10-27 04:04:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:03,047 INFO L225 Difference]: With dead ends: 307 [2018-10-27 04:04:03,048 INFO L226 Difference]: Without dead ends: 275 [2018-10-27 04:04:03,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:04:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-27 04:04:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 217. [2018-10-27 04:04:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 04:04:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2018-10-27 04:04:03,090 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 49 [2018-10-27 04:04:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:03,090 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2018-10-27 04:04:03,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:04:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2018-10-27 04:04:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:04:03,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:03,092 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 04:04:03,092 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:03,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash -139141365, now seen corresponding path program 4 times [2018-10-27 04:04:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:03,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:04:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:03,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:03,574 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 5 [2018-10-27 04:04:03,910 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2018-10-27 04:04:04,258 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 04:04:04,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:04,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:04:04,258 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:04:04,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:04:04,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:04,259 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:04:04,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:04,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:04:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:04,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:04:04,396 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 04:04:04,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,402 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 04:04:04,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,426 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 04:04:04,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:48 [2018-10-27 04:04:04,534 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 32 treesize of output 25 [2018-10-27 04:04:04,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-27 04:04:04,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:04:04,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:36 [2018-10-27 04:04:04,813 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 39 treesize of output 31 [2018-10-27 04:04:04,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,816 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:04,817 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:04,817 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:04,823 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 31 treesize of output 53 [2018-10-27 04:04:04,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:04,839 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 04:04:04,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-10-27 04:04:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:04,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:05,220 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 53 treesize of output 47 [2018-10-27 04:04:05,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,225 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 47 treesize of output 54 [2018-10-27 04:04:05,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,312 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 36 treesize of output 58 [2018-10-27 04:04:05,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,317 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,319 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,325 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,344 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 97 [2018-10-27 04:04:05,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,376 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 97 [2018-10-27 04:04:05,378 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,382 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,399 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 41 treesize of output 63 [2018-10-27 04:04:05,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,404 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,404 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,405 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,410 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,427 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 45 treesize of output 98 [2018-10-27 04:04:05,430 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,433 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,433 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,440 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,616 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 54 treesize of output 95 [2018-10-27 04:04:05,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,658 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,670 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:05,698 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 46 treesize of output 99 [2018-10-27 04:04:05,701 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:04:05,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:05,870 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:64, output treesize:44 [2018-10-27 04:04:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:05,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:04:05,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 39 [2018-10-27 04:04:05,946 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:04:05,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 04:04:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 04:04:05,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:04:05,947 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand 32 states. [2018-10-27 04:04:07,619 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-27 04:04:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:08,234 INFO L93 Difference]: Finished difference Result 299 states and 352 transitions. [2018-10-27 04:04:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 04:04:08,234 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2018-10-27 04:04:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:08,237 INFO L225 Difference]: With dead ends: 299 [2018-10-27 04:04:08,237 INFO L226 Difference]: Without dead ends: 297 [2018-10-27 04:04:08,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2018-10-27 04:04:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-27 04:04:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 227. [2018-10-27 04:04:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-27 04:04:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2018-10-27 04:04:08,298 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 48 [2018-10-27 04:04:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:08,299 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2018-10-27 04:04:08,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 04:04:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2018-10-27 04:04:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:04:08,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:08,300 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:04:08,300 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:08,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -740834584, now seen corresponding path program 1 times [2018-10-27 04:04:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:08,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:08,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:08,643 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 04:04:09,143 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2018-10-27 04:04:09,506 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2018-10-27 04:04:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:10,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:10,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:04:10,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-27 04:04:10,031 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 04:04:10,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:04:10,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:04:10,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:04:11,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:04:11,838 INFO L272 AbstractInterpreter]: Visited 26 different actions 340 times. Merged at 16 different actions 238 times. Widened at 4 different actions 33 times. Found 36 fixpoints after 7 different actions. Largest state had 39 variables. [2018-10-27 04:04:11,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:11,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:04:11,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:11,848 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:04:11,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:11,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:04:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:11,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:04:12,086 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 04:04:12,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,090 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 04:04:12,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,107 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 04:04:12,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 04:04:12,226 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 32 treesize of output 25 [2018-10-27 04:04:12,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-27 04:04:12,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:04:12,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-27 04:04:12,327 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 04:04:12,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:12,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,338 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 04:04:12,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,353 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 04:04:12,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 04:04:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:04:12,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:12,688 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 04:04:12,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,694 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 04:04:12,761 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:12,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,769 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,770 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,771 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,791 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 04:04:12,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:12,795 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,796 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,830 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 04:04:12,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:12,853 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:12,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,869 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:12,869 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:12,894 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,944 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,944 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,946 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,964 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 04:04:12,966 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:12,968 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,969 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,974 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:12,994 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 04:04:12,996 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:13,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:13,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:13,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:04:13,051 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:62, output treesize:13 [2018-10-27 04:04:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:13,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:04:13,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 39 [2018-10-27 04:04:13,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:04:13,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 04:04:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 04:04:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:04:13,166 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand 29 states. [2018-10-27 04:04:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:16,937 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-10-27 04:04:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-27 04:04:16,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-10-27 04:04:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:16,941 INFO L225 Difference]: With dead ends: 433 [2018-10-27 04:04:16,941 INFO L226 Difference]: Without dead ends: 344 [2018-10-27 04:04:16,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=920, Invalid=5400, Unknown=0, NotChecked=0, Total=6320 [2018-10-27 04:04:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-27 04:04:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 176. [2018-10-27 04:04:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-27 04:04:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2018-10-27 04:04:17,004 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 51 [2018-10-27 04:04:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:17,004 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2018-10-27 04:04:17,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 04:04:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2018-10-27 04:04:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:04:17,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:17,005 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:04:17,005 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:17,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2124575766, now seen corresponding path program 1 times [2018-10-27 04:04:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:17,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:17,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:17,670 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-27 04:04:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:19,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:04:19,016 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-27 04:04:19,016 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 04:04:19,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:04:19,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:04:19,021 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:04:21,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:04:21,430 INFO L272 AbstractInterpreter]: Visited 31 different actions 618 times. Merged at 19 different actions 390 times. Widened at 5 different actions 41 times. Found 80 fixpoints after 9 different actions. Largest state had 40 variables. [2018-10-27 04:04:21,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:21,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:04:21,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:04:21,439 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:04:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:04:21,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:04:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:21,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:04:21,708 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 04:04:21,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:21,742 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 04:04:21,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:21,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:21,760 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 04:04:21,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-27 04:04:21,880 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 34 [2018-10-27 04:04:21,883 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:21,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:21,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:21,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:21,895 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 80 [2018-10-27 04:04:21,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:21,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:21,918 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 04:04:21,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-10-27 04:04:22,072 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 66 treesize of output 53 [2018-10-27 04:04:22,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 154 [2018-10-27 04:04:22,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:22,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:04:22,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:04:22,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:114 [2018-10-27 04:04:22,683 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 55 treesize of output 44 [2018-10-27 04:04:22,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:22,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:22,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 104 [2018-10-27 04:04:22,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:22,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:22,736 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 04:04:22,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:27 [2018-10-27 04:04:23,155 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 04:04:23,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:23,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:23,248 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 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 04:04:23,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:23,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:23,429 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 04:04:23,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:3 [2018-10-27 04:04:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:23,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:24,952 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 137 treesize of output 127 [2018-10-27 04:04:24,984 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,007 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 3 case distinctions, treesize of input 119 treesize of output 136 [2018-10-27 04:04:25,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 171 [2018-10-27 04:04:25,143 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:25,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 187 [2018-10-27 04:04:25,513 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2018-10-27 04:04:25,521 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:25,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:25,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:25,526 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,528 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,529 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,532 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,560 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 175 [2018-10-27 04:04:25,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:25,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:25,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,597 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,598 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,604 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,621 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 175 [2018-10-27 04:04:25,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:25,645 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:25,645 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,648 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,649 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,652 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,680 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 175 [2018-10-27 04:04:25,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:25,706 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:25,706 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:25,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:25,711 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,714 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,714 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,717 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,722 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,744 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:25,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 175 [2018-10-27 04:04:25,766 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:25,768 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:25,768 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,082 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,087 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,088 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 0 case distinctions, treesize of input 68 treesize of output 94 [2018-10-27 04:04:26,089 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,170 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,175 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 93 [2018-10-27 04:04:26,176 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:04:26,327 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,329 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,335 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,335 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 199 [2018-10-27 04:04:26,727 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-10-27 04:04:26,731 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:26,731 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,740 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 136 [2018-10-27 04:04:26,752 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:26,754 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:26,754 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,760 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,760 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,761 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,764 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,764 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,770 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,774 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 136 [2018-10-27 04:04:26,776 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:26,779 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:26,780 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:26,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,787 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,788 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,788 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,789 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,793 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,797 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,801 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 136 [2018-10-27 04:04:26,804 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:26,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,813 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:26,818 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,823 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:26,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 136 [2018-10-27 04:04:26,825 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:27,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:27,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,088 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,092 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,098 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,098 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,108 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 231 [2018-10-27 04:04:27,166 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 20 xjuncts. [2018-10-27 04:04:27,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:27,396 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,399 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:27,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,409 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 130 [2018-10-27 04:04:27,414 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:27,485 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:27,753 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,771 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,771 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:27,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 270 [2018-10-27 04:04:27,911 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 Received shutdown request... [2018-10-27 04:04:39,035 WARN L187 SmtUtils]: Removed 221 from assertion stack [2018-10-27 04:04:39,036 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 04:04:39,236 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:04:39,237 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 04:04:39,242 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 04:04:39,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:04:39 BoogieIcfgContainer [2018-10-27 04:04:39,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:04:39,243 INFO L168 Benchmark]: Toolchain (without parser) took 251133.92 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-27 04:04:39,244 INFO L168 Benchmark]: CDTParser took 0.19 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 04:04:39,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.64 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 04:04:39,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.70 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 04:04:39,244 INFO L168 Benchmark]: Boogie Preprocessor took 27.21 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 04:04:39,245 INFO L168 Benchmark]: RCFGBuilder took 611.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-27 04:04:39,245 INFO L168 Benchmark]: TraceAbstraction took 250163.05 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 889.7 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -463.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-27 04:04:39,246 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.19 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 287.64 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 39.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.21 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 611.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250163.05 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 889.7 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -463.5 MB). Peak memory consumption was 1.5 GB. 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 53 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 6639. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 250.0s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 41.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 718 SDtfs, 2643 SDslu, 6165 SDs, 0 SdLazy, 8199 SolverSat, 1736 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 896 SyntacticMatches, 80 SemanticMatches, 867 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 15778 ImplicationChecksByTransitivity, 151.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.9s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 170.6s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1302 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1897 ConstructedInterpolants, 360 QuantifiedInterpolants, 1230864 SizeOfPredicates, 480 NumberOfNonLiveVariables, 2957 ConjunctsInSsa, 787 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 228/1223 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown