java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:50:39,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:50:39,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:50:39,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:50:39,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:50:39,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:50:39,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:50:39,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:50:39,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:50:39,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:50:39,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:50:39,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:50:39,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:50:39,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:50:39,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:50:39,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:50:39,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:50:39,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:50:39,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:50:39,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:50:39,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:50:39,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:50:39,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:50:39,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:50:39,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:50:39,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:50:39,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:50:39,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:50:39,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:50:39,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:50:39,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:50:39,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:50:39,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:50:39,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:50:39,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:50:39,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:50:39,496 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:50:39,520 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:50:39,520 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:50:39,521 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:50:39,522 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:50:39,522 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:50:39,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:50:39,523 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:50:39,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:50:39,523 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:50:39,523 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:50:39,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:50:39,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:50:39,524 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:50:39,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:50:39,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:50:39,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:50:39,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:50:39,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:50:39,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:50:39,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:50:39,528 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:50:39,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:50:39,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:39,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:50:39,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:50:39,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:50:39,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:50:39,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:50:39,603 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:50:39,604 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:50:39,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-09-23 19:50:39,605 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-23 19:50:39,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:50:39,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:50:39,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:39,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:50:39,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:50:39,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,702 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:50:39,702 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:50:39,702 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:50:39,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:39,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:50:39,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:50:39,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:50:39,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... [2018-09-23 19:50:39,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:50:39,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:50:39,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:50:39,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:50:39,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 19:50:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 19:50:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-23 19:50:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-23 19:50:40,189 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:50:40,189 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:40 BoogieIcfgContainer [2018-09-23 19:50:40,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:50:40,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:50:40,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:50:40,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:50:40,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:39" (1/2) ... [2018-09-23 19:50:40,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37874f36 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:50:40, skipping insertion in model container [2018-09-23 19:50:40,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:40" (2/2) ... [2018-09-23 19:50:40,198 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-23 19:50:40,206 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:50:40,213 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-23 19:50:40,261 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:50:40,262 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:50:40,262 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:50:40,262 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:50:40,262 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:50:40,263 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:50:40,263 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:50:40,263 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:50:40,263 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:50:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-23 19:50:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 19:50:40,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:40,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 19:50:40,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:40,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-23 19:50:40,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:40,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:40,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:40,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:50:40,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:50:40,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:50:40,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:50:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:50:40,513 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-09-23 19:50:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:40,606 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-09-23 19:50:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:50:40,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-23 19:50:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:40,622 INFO L225 Difference]: With dead ends: 20 [2018-09-23 19:50:40,622 INFO L226 Difference]: Without dead ends: 10 [2018-09-23 19:50:40,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:50:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-23 19:50:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-23 19:50:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-23 19:50:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-23 19:50:40,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-23 19:50:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:40,661 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-23 19:50:40,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:50:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-23 19:50:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:50:40,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:40,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:50:40,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:40,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-23 19:50:40,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:40,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:40,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:40,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:40,803 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:50:40,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:50:40,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:50:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:50:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:50:40,807 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-23 19:50:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:40,993 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-23 19:50:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:50:40,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 19:50:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:40,994 INFO L225 Difference]: With dead ends: 17 [2018-09-23 19:50:40,995 INFO L226 Difference]: Without dead ends: 16 [2018-09-23 19:50:40,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:50:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-23 19:50:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-23 19:50:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 19:50:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-23 19:50:41,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-23 19:50:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:41,002 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-23 19:50:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:50:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-23 19:50:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:50:41,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:41,003 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-23 19:50:41,003 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:41,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-23 19:50:41,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:41,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:50:41,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:50:41,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:50:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:50:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:41,048 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-23 19:50:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:41,070 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-23 19:50:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:50:41,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-23 19:50:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:41,072 INFO L225 Difference]: With dead ends: 18 [2018-09-23 19:50:41,072 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 19:50:41,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 19:50:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-23 19:50:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 19:50:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-23 19:50:41,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-23 19:50:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:41,077 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-23 19:50:41,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:50:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-23 19:50:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 19:50:41,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:41,078 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-23 19:50:41,078 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:41,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-23 19:50:41,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:41,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:41,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:41,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:41,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:41,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:41,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:41,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:41,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:41,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:41,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-23 19:50:41,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:50:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:50:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:50:41,779 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-23 19:50:42,024 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-09-23 19:50:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:42,133 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-23 19:50:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:50:42,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-23 19:50:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:42,139 INFO L225 Difference]: With dead ends: 20 [2018-09-23 19:50:42,139 INFO L226 Difference]: Without dead ends: 19 [2018-09-23 19:50:42,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:50:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-23 19:50:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-23 19:50:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-23 19:50:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-23 19:50:42,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-23 19:50:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:42,148 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-23 19:50:42,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:50:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-23 19:50:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-23 19:50:42,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:42,150 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-23 19:50:42,150 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-23 19:50:42,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:42,366 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:42,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-23 19:50:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:42,420 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:42,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:42,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:42,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:42,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:42,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:42,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:42,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:42,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-23 19:50:42,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:50:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:50:42,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:50:42,609 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-09-23 19:50:42,904 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:50:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:43,113 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-23 19:50:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:50:43,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-23 19:50:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:43,121 INFO L225 Difference]: With dead ends: 25 [2018-09-23 19:50:43,121 INFO L226 Difference]: Without dead ends: 24 [2018-09-23 19:50:43,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-23 19:50:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-23 19:50:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-23 19:50:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-23 19:50:43,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-23 19:50:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:43,129 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-23 19:50:43,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:50:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-23 19:50:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:50:43,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:43,130 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-23 19:50:43,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:43,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-23 19:50:43,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:43,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:43,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:43,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:43,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:43,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 19:50:43,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:43,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:43,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:43,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:43,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:43,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:43,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:43,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-23 19:50:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 19:50:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 19:50:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:50:43,455 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-23 19:50:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:43,771 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-23 19:50:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:50:43,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-23 19:50:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:43,774 INFO L225 Difference]: With dead ends: 30 [2018-09-23 19:50:43,774 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 19:50:43,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:50:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 19:50:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-23 19:50:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-23 19:50:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-23 19:50:43,781 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-23 19:50:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:43,781 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-23 19:50:43,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 19:50:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-23 19:50:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-23 19:50:43,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:43,783 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-23 19:50:43,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:43,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:43,783 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-23 19:50:43,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,026 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:44,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:44,081 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:44,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:44,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:44,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:44,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:44,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 19:50:44,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:50:44,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:50:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:44,247 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-23 19:50:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:44,523 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-23 19:50:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:50:44,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-23 19:50:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:44,525 INFO L225 Difference]: With dead ends: 35 [2018-09-23 19:50:44,526 INFO L226 Difference]: Without dead ends: 34 [2018-09-23 19:50:44,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:50:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-23 19:50:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-23 19:50:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-23 19:50:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-23 19:50:44,533 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-23 19:50:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:44,534 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-23 19:50:44,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:50:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-23 19:50:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 19:50:44,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:44,535 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-23 19:50:44,535 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:44,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-23 19:50:44,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:44,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:44,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:44,743 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:44,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 19:50:44,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:44,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:44,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:44,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:45,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:50:45,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:50:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:50:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:50:45,044 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-23 19:50:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:45,484 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-23 19:50:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:50:45,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-23 19:50:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:45,486 INFO L225 Difference]: With dead ends: 40 [2018-09-23 19:50:45,486 INFO L226 Difference]: Without dead ends: 39 [2018-09-23 19:50:45,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:50:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-23 19:50:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-23 19:50:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-23 19:50:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-23 19:50:45,493 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-23 19:50:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:45,494 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-23 19:50:45,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:50:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-23 19:50:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-23 19:50:45,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:45,495 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-23 19:50:45,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:45,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:45,496 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-23 19:50:45,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:45,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,853 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:45,853 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:45,900 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 19:50:45,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:45,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:45,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:45,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:46,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:46,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-23 19:50:46,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:50:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:50:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:50:46,167 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-09-23 19:50:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:46,505 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-23 19:50:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:50:46,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-23 19:50:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:46,509 INFO L225 Difference]: With dead ends: 45 [2018-09-23 19:50:46,509 INFO L226 Difference]: Without dead ends: 44 [2018-09-23 19:50:46,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:50:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-23 19:50:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-23 19:50:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 19:50:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-23 19:50:46,518 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-23 19:50:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:46,519 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-23 19:50:46,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:50:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-23 19:50:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 19:50:46,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:46,520 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-23 19:50:46,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:46,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:46,521 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-23 19:50:46,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:46,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:46,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:46,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:46,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:46,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:47,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:47,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-23 19:50:47,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-23 19:50:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-23 19:50:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:50:47,248 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-09-23 19:50:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:47,713 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-23 19:50:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:50:47,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-23 19:50:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:47,714 INFO L225 Difference]: With dead ends: 50 [2018-09-23 19:50:47,714 INFO L226 Difference]: Without dead ends: 49 [2018-09-23 19:50:47,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:50:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-23 19:50:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-23 19:50:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-23 19:50:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-23 19:50:47,723 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-23 19:50:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-23 19:50:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-23 19:50:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-23 19:50:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-23 19:50:47,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:47,725 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-23 19:50:47,726 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:47,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-23 19:50:47,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:48,882 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:48,882 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:48,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:48,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:48,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:48,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:48,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:48,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:48,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:48,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:49,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:49,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-23 19:50:49,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:50:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:50:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:50:49,309 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-09-23 19:50:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:49,702 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-23 19:50:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:50:49,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-09-23 19:50:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:49,704 INFO L225 Difference]: With dead ends: 55 [2018-09-23 19:50:49,704 INFO L226 Difference]: Without dead ends: 54 [2018-09-23 19:50:49,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:50:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-23 19:50:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-23 19:50:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-23 19:50:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-23 19:50:49,714 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-23 19:50:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:49,715 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-23 19:50:49,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:50:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-23 19:50:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-23 19:50:49,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:49,716 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-23 19:50:49,716 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:49,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-23 19:50:49,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:49,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:50,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:50,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:50,237 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:50:50,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:50,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:50,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:50,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:50,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:50,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:50,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:50,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-23 19:50:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 19:50:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 19:50:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:50:50,606 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-09-23 19:50:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:51,170 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-23 19:50:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:50:51,173 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-09-23 19:50:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:51,174 INFO L225 Difference]: With dead ends: 60 [2018-09-23 19:50:51,174 INFO L226 Difference]: Without dead ends: 59 [2018-09-23 19:50:51,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 19:50:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-23 19:50:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-23 19:50:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-23 19:50:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-23 19:50:51,184 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-23 19:50:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:51,185 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-23 19:50:51,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 19:50:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-23 19:50:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-23 19:50:51,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:51,186 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-23 19:50:51,186 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:51,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-23 19:50:51,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:51,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:51,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:51,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:51,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:51,478 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:51,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:51,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:51,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:51,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:51,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:51,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:51,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:51,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-23 19:50:51,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 19:50:51,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 19:50:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:50:51,773 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-09-23 19:50:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:52,333 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-23 19:50:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:50:52,333 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-09-23 19:50:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:52,334 INFO L225 Difference]: With dead ends: 65 [2018-09-23 19:50:52,334 INFO L226 Difference]: Without dead ends: 64 [2018-09-23 19:50:52,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:50:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-23 19:50:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-23 19:50:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 19:50:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-23 19:50:52,345 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-23 19:50:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-23 19:50:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 19:50:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-23 19:50:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 19:50:52,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:52,347 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-23 19:50:52,347 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:52,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-23 19:50:52,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:52,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:52,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:52,781 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:52,864 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:50:52,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:52,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:52,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:52,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:52,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:52,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:53,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:53,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-23 19:50:53,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-23 19:50:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-23 19:50:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:50:53,200 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-09-23 19:50:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:53,702 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-23 19:50:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:50:53,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-09-23 19:50:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:53,704 INFO L225 Difference]: With dead ends: 70 [2018-09-23 19:50:53,704 INFO L226 Difference]: Without dead ends: 69 [2018-09-23 19:50:53,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-09-23 19:50:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-23 19:50:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-23 19:50:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-23 19:50:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-23 19:50:53,717 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-23 19:50:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:53,717 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-23 19:50:53,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-23 19:50:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-23 19:50:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-23 19:50:53,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:53,718 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-23 19:50:53,719 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:53,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-23 19:50:53,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:53,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:53,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:54,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:54,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:54,375 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:54,433 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:50:54,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:54,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:54,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:54,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:54,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:54,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:54,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:54,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-23 19:50:54,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 19:50:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 19:50:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:50:54,743 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-09-23 19:50:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:55,223 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-23 19:50:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:50:55,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-09-23 19:50:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:55,225 INFO L225 Difference]: With dead ends: 75 [2018-09-23 19:50:55,225 INFO L226 Difference]: Without dead ends: 74 [2018-09-23 19:50:55,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:50:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-23 19:50:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-23 19:50:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-23 19:50:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-23 19:50:55,241 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-23 19:50:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:55,241 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-23 19:50:55,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 19:50:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-23 19:50:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-23 19:50:55,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:55,243 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-23 19:50:55,243 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:55,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-23 19:50:55,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:55,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:55,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-09-23 19:50:55,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:55,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:55,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:56,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-23 19:50:56,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 19:50:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 19:50:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:50:56,087 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-09-23 19:50:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:56,863 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-23 19:50:56,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:50:56,864 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-09-23 19:50:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:56,865 INFO L225 Difference]: With dead ends: 80 [2018-09-23 19:50:56,865 INFO L226 Difference]: Without dead ends: 79 [2018-09-23 19:50:56,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-09-23 19:50:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-23 19:50:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-23 19:50:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-23 19:50:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-23 19:50:56,884 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-23 19:50:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:56,884 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-23 19:50:56,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 19:50:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-23 19:50:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-23 19:50:56,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:56,887 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-23 19:50:56,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:56,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-23 19:50:56,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:57,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:57,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:57,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:57,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:57,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:57,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:57,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:57,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-23 19:50:57,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 19:50:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 19:50:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:50:57,704 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-09-23 19:50:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:58,366 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-23 19:50:58,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:50:58,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-09-23 19:50:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:58,371 INFO L225 Difference]: With dead ends: 85 [2018-09-23 19:50:58,371 INFO L226 Difference]: Without dead ends: 84 [2018-09-23 19:50:58,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:50:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-23 19:50:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-23 19:50:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 19:50:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-23 19:50:58,385 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-23 19:50:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:58,385 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-23 19:50:58,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 19:50:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-23 19:50:58,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 19:50:58,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:58,386 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-23 19:50:58,387 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:50:58,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-23 19:50:58,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:58,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:58,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:58,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:59,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-09-23 19:50:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:59,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 19:50:59,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:59,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:59,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:59,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:59,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-23 19:50:59,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-23 19:50:59,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-23 19:50:59,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:50:59,808 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-09-23 19:51:00,721 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:51:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:01,002 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-23 19:51:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:51:01,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-09-23 19:51:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:01,003 INFO L225 Difference]: With dead ends: 90 [2018-09-23 19:51:01,003 INFO L226 Difference]: Without dead ends: 89 [2018-09-23 19:51:01,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-09-23 19:51:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-23 19:51:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-23 19:51:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-23 19:51:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-23 19:51:01,019 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-23 19:51:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:01,019 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-23 19:51:01,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-23 19:51:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-23 19:51:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-23 19:51:01,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:01,020 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-23 19:51:01,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:01,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-23 19:51:01,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:01,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:01,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:01,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:01,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:01,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:01,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:01,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:01,395 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:01,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:01,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:01,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:01,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:01,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:01,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:01,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:01,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-23 19:51:01,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 19:51:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 19:51:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:51:01,765 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-09-23 19:51:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:02,374 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-23 19:51:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:51:02,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-09-23 19:51:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:02,375 INFO L225 Difference]: With dead ends: 95 [2018-09-23 19:51:02,375 INFO L226 Difference]: Without dead ends: 94 [2018-09-23 19:51:02,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-23 19:51:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-23 19:51:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-23 19:51:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-23 19:51:02,386 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-23 19:51:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:02,387 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-23 19:51:02,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 19:51:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-23 19:51:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-23 19:51:02,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:02,387 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-23 19:51:02,388 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:02,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-23 19:51:02,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:02,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:02,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:02,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:02,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-09-23 19:51:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:02,959 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-23 19:51:02,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:02,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:02,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:02,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:02,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:02,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:03,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:03,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-23 19:51:03,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-23 19:51:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-23 19:51:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:51:03,366 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-09-23 19:51:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:04,029 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-23 19:51:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:51:04,029 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-09-23 19:51:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:04,031 INFO L225 Difference]: With dead ends: 100 [2018-09-23 19:51:04,031 INFO L226 Difference]: Without dead ends: 99 [2018-09-23 19:51:04,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-09-23 19:51:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-23 19:51:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-23 19:51:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-23 19:51:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-23 19:51:04,044 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-23 19:51:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:04,044 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-23 19:51:04,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-23 19:51:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-23 19:51:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-23 19:51:04,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:04,046 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-23 19:51:04,046 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:04,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-23 19:51:04,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:04,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:04,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:04,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:04,671 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-23 19:51:04,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:04,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:04,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:04,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:04,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:04,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:05,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:05,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-23 19:51:05,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 19:51:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 19:51:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:51:05,089 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-09-23 19:51:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:05,866 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-23 19:51:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:51:05,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-09-23 19:51:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:05,867 INFO L225 Difference]: With dead ends: 105 [2018-09-23 19:51:05,867 INFO L226 Difference]: Without dead ends: 104 [2018-09-23 19:51:05,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-23 19:51:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-23 19:51:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-23 19:51:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-23 19:51:05,887 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-23 19:51:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:05,888 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-23 19:51:05,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 19:51:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-23 19:51:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-23 19:51:05,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:05,889 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-23 19:51:05,889 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:05,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-23 19:51:05,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:05,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,306 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:06,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:06,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:06,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:06,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-23 19:51:06,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-23 19:51:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-23 19:51:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:51:06,846 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-09-23 19:51:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:07,607 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-23 19:51:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:51:07,610 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-09-23 19:51:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:07,611 INFO L225 Difference]: With dead ends: 110 [2018-09-23 19:51:07,611 INFO L226 Difference]: Without dead ends: 109 [2018-09-23 19:51:07,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-09-23 19:51:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-23 19:51:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-23 19:51:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-23 19:51:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-23 19:51:07,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-23 19:51:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:07,625 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-23 19:51:07,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-23 19:51:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-23 19:51:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-23 19:51:07,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:07,626 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-23 19:51:07,626 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:07,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-23 19:51:07,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:07,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:07,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:07,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:08,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:08,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:08,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:08,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:08,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:08,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:08,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:10,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:10,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-23 19:51:10,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 19:51:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 19:51:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:51:10,081 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-09-23 19:51:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:10,877 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-23 19:51:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:51:10,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-09-23 19:51:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:10,878 INFO L225 Difference]: With dead ends: 115 [2018-09-23 19:51:10,878 INFO L226 Difference]: Without dead ends: 114 [2018-09-23 19:51:10,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-23 19:51:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-23 19:51:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-23 19:51:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-23 19:51:10,894 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-23 19:51:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-23 19:51:10,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 19:51:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-23 19:51:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-23 19:51:10,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:10,895 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-23 19:51:10,896 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:10,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-23 19:51:10,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:10,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:11,301 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:11,301 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:11,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-23 19:51:11,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:11,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:11,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:11,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:11,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:11,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-23 19:51:11,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 19:51:11,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 19:51:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:51:11,932 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-09-23 19:51:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:12,789 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-23 19:51:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 19:51:12,789 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-09-23 19:51:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:12,791 INFO L225 Difference]: With dead ends: 120 [2018-09-23 19:51:12,791 INFO L226 Difference]: Without dead ends: 119 [2018-09-23 19:51:12,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-09-23 19:51:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-23 19:51:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-23 19:51:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-23 19:51:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-23 19:51:12,810 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-23 19:51:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:12,810 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-23 19:51:12,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 19:51:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-23 19:51:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-23 19:51:12,811 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:12,811 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-23 19:51:12,811 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:12,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-23 19:51:12,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:12,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:13,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:13,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:13,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:13,464 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:13,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:13,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:13,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:13,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:14,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:14,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-23 19:51:14,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 19:51:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 19:51:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:51:14,136 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-09-23 19:51:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:15,060 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-23 19:51:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:51:15,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-09-23 19:51:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:15,062 INFO L225 Difference]: With dead ends: 125 [2018-09-23 19:51:15,062 INFO L226 Difference]: Without dead ends: 124 [2018-09-23 19:51:15,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-23 19:51:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-23 19:51:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-23 19:51:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-23 19:51:15,081 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-23 19:51:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:15,082 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-23 19:51:15,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 19:51:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-23 19:51:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-23 19:51:15,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:15,083 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-23 19:51:15,083 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:15,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-23 19:51:15,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:16,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:16,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:16,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:16,382 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-23 19:51:16,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:16,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:16,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:16,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:16,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:16,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-23 19:51:16,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-23 19:51:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-23 19:51:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:51:16,890 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-09-23 19:51:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:18,026 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-23 19:51:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:51:18,027 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-09-23 19:51:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:18,027 INFO L225 Difference]: With dead ends: 130 [2018-09-23 19:51:18,027 INFO L226 Difference]: Without dead ends: 129 [2018-09-23 19:51:18,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-09-23 19:51:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-23 19:51:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-23 19:51:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-23 19:51:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-23 19:51:18,045 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-23 19:51:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:18,045 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-23 19:51:18,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-23 19:51:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-23 19:51:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-23 19:51:18,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:18,046 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-23 19:51:18,046 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:18,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-23 19:51:18,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:18,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:18,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:18,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:18,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:18,626 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:18,626 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:18,634 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:18,763 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-23 19:51:18,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:18,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:18,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:18,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:19,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:19,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-23 19:51:19,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-23 19:51:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-23 19:51:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:51:19,328 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-09-23 19:51:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:20,308 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-23 19:51:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:51:20,308 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-09-23 19:51:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:20,309 INFO L225 Difference]: With dead ends: 135 [2018-09-23 19:51:20,309 INFO L226 Difference]: Without dead ends: 134 [2018-09-23 19:51:20,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:51:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-23 19:51:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-23 19:51:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-23 19:51:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-23 19:51:20,331 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-23 19:51:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:20,331 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-23 19:51:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-23 19:51:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-23 19:51:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-23 19:51:20,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:20,332 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-23 19:51:20,332 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:20,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-23 19:51:20,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:20,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:20,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:20,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:21,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:21,435 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:21,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:21,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:21,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:21,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:21,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:21,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:22,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:22,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-23 19:51:22,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-23 19:51:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-23 19:51:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:22,179 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-09-23 19:51:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:23,384 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-23 19:51:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:51:23,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-09-23 19:51:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:23,386 INFO L225 Difference]: With dead ends: 140 [2018-09-23 19:51:23,386 INFO L226 Difference]: Without dead ends: 139 [2018-09-23 19:51:23,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-09-23 19:51:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-23 19:51:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-23 19:51:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-23 19:51:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-23 19:51:23,408 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-23 19:51:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:23,409 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-23 19:51:23,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-23 19:51:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-23 19:51:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-23 19:51:23,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:23,410 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-23 19:51:23,410 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:23,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-23 19:51:23,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:24,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:24,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:24,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:24,188 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:24,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:24,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:24,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:24,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:24,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:24,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:25,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:25,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-23 19:51:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 19:51:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 19:51:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:51:25,807 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-09-23 19:51:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:26,897 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-23 19:51:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:51:26,898 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-09-23 19:51:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:26,899 INFO L225 Difference]: With dead ends: 145 [2018-09-23 19:51:26,899 INFO L226 Difference]: Without dead ends: 144 [2018-09-23 19:51:26,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:51:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-23 19:51:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-23 19:51:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 19:51:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-23 19:51:26,925 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-23 19:51:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:26,926 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-23 19:51:26,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 19:51:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-23 19:51:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 19:51:26,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:26,927 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-23 19:51:26,927 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:26,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:26,928 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-23 19:51:26,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:26,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:26,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:27,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:27,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:27,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:27,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-23 19:51:27,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:27,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:27,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:27,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:27,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:27,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:28,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:28,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-23 19:51:28,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-23 19:51:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-23 19:51:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 19:51:28,745 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-09-23 19:51:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:30,017 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-23 19:51:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:51:30,018 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-09-23 19:51:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:30,019 INFO L225 Difference]: With dead ends: 150 [2018-09-23 19:51:30,019 INFO L226 Difference]: Without dead ends: 149 [2018-09-23 19:51:30,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-09-23 19:51:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-23 19:51:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-23 19:51:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-23 19:51:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-23 19:51:30,043 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-23 19:51:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:30,043 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-23 19:51:30,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-23 19:51:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-23 19:51:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-23 19:51:30,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:30,044 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-23 19:51:30,044 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:30,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-23 19:51:30,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:30,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:30,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:30,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:30,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:30,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:30,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:30,974 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:30,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:30,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:30,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:30,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:31,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:31,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-23 19:51:31,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 19:51:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 19:51:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:31,811 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-09-23 19:51:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:33,123 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-23 19:51:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 19:51:33,124 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-09-23 19:51:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:33,124 INFO L225 Difference]: With dead ends: 155 [2018-09-23 19:51:33,125 INFO L226 Difference]: Without dead ends: 154 [2018-09-23 19:51:33,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:51:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-23 19:51:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-23 19:51:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-23 19:51:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-23 19:51:33,153 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-23 19:51:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:33,154 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-23 19:51:33,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 19:51:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-23 19:51:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-23 19:51:33,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:33,155 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-23 19:51:33,155 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:33,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-23 19:51:33,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:33,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:33,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:33,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:34,087 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:34,087 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:34,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:34,244 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-23 19:51:34,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:34,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:34,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:34,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:34,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:34,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:35,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:35,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-23 19:51:35,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-23 19:51:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-23 19:51:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 19:51:35,111 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-09-23 19:51:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:36,392 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-23 19:51:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-23 19:51:36,392 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-09-23 19:51:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:36,393 INFO L225 Difference]: With dead ends: 160 [2018-09-23 19:51:36,393 INFO L226 Difference]: Without dead ends: 159 [2018-09-23 19:51:36,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-09-23 19:51:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-23 19:51:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-23 19:51:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-23 19:51:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-23 19:51:36,418 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-23 19:51:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:36,418 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-23 19:51:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-23 19:51:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-23 19:51:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-23 19:51:36,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:36,419 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-23 19:51:36,419 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:36,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-23 19:51:36,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:36,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:36,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:37,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:37,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:37,581 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:37,751 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-23 19:51:37,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:37,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:37,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:37,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:37,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:37,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:38,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:38,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-23 19:51:38,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-23 19:51:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-23 19:51:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:51:38,540 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-09-23 19:51:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:40,183 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-23 19:51:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-23 19:51:40,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-09-23 19:51:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:40,185 INFO L225 Difference]: With dead ends: 165 [2018-09-23 19:51:40,185 INFO L226 Difference]: Without dead ends: 164 [2018-09-23 19:51:40,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:51:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-23 19:51:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-23 19:51:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-23 19:51:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-23 19:51:40,210 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-23 19:51:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:40,210 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-23 19:51:40,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-23 19:51:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-23 19:51:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-23 19:51:40,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:40,212 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-23 19:51:40,212 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:40,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-23 19:51:40,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:40,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:41,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:41,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:41,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:41,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:41,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:41,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:41,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:42,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:42,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-23 19:51:42,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 19:51:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 19:51:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:42,303 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-09-23 19:51:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:43,645 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-23 19:51:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-23 19:51:43,646 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-09-23 19:51:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:43,647 INFO L225 Difference]: With dead ends: 170 [2018-09-23 19:51:43,647 INFO L226 Difference]: Without dead ends: 169 [2018-09-23 19:51:43,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-09-23 19:51:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-23 19:51:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-23 19:51:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-23 19:51:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-23 19:51:43,681 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-23 19:51:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:43,682 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-23 19:51:43,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 19:51:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-23 19:51:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-23 19:51:43,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:43,683 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-23 19:51:43,683 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:43,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-23 19:51:43,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:44,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:44,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:44,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:45,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:45,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:45,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:45,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:45,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:45,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:45,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-23 19:51:45,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 19:51:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 19:51:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:51:45,976 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-09-23 19:51:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:47,575 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-23 19:51:47,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-23 19:51:47,576 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-09-23 19:51:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:47,577 INFO L225 Difference]: With dead ends: 175 [2018-09-23 19:51:47,577 INFO L226 Difference]: Without dead ends: 174 [2018-09-23 19:51:47,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:51:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-23 19:51:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-23 19:51:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-23 19:51:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-23 19:51:47,612 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-23 19:51:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:47,612 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-23 19:51:47,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 19:51:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-23 19:51:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-23 19:51:47,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:47,614 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-23 19:51:47,614 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:47,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-23 19:51:47,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:47,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:47,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:49,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:49,123 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:49,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:49,324 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-23 19:51:49,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:49,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:49,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:49,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:49,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:49,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:50,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:50,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-23 19:51:50,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-23 19:51:50,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-23 19:51:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:51:50,254 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-09-23 19:51:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:52,322 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-23 19:51:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:51:52,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-09-23 19:51:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:52,323 INFO L225 Difference]: With dead ends: 180 [2018-09-23 19:51:52,323 INFO L226 Difference]: Without dead ends: 179 [2018-09-23 19:51:52,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-09-23 19:51:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-23 19:51:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-23 19:51:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-23 19:51:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-23 19:51:52,354 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-23 19:51:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:52,355 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-23 19:51:52,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-23 19:51:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-23 19:51:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-23 19:51:52,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:52,356 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-23 19:51:52,356 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:52,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-23 19:51:52,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:52,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:52,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:53,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:53,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:53,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:53,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:53,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:53,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:53,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:53,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:53,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:54,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:54,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-23 19:51:54,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 19:51:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 19:51:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:54,840 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-09-23 19:51:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:56,506 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-23 19:51:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-23 19:51:56,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-09-23 19:51:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:56,508 INFO L225 Difference]: With dead ends: 185 [2018-09-23 19:51:56,508 INFO L226 Difference]: Without dead ends: 184 [2018-09-23 19:51:56,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:51:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-23 19:51:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-23 19:51:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-23 19:51:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-23 19:51:56,539 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-23 19:51:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:56,539 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-23 19:51:56,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 19:51:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-23 19:51:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-23 19:51:56,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:56,540 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-23 19:51:56,541 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:51:56,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-23 19:51:56,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:57,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:57,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:57,456 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:57,640 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-23 19:51:57,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:57,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:57,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:57,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:57,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:57,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:58,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:58,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-23 19:51:58,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-23 19:51:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-23 19:51:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 19:51:58,756 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-09-23 19:52:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:00,553 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-23 19:52:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 19:52:00,554 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-09-23 19:52:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:00,555 INFO L225 Difference]: With dead ends: 190 [2018-09-23 19:52:00,555 INFO L226 Difference]: Without dead ends: 189 [2018-09-23 19:52:00,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-09-23 19:52:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-23 19:52:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-23 19:52:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-23 19:52:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-23 19:52:00,586 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-23 19:52:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:00,586 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-23 19:52:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-23 19:52:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-23 19:52:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-23 19:52:00,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:00,588 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-23 19:52:00,588 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:00,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:00,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-23 19:52:00,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:00,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:00,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:00,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:01,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:01,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:01,560 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:01,774 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-23 19:52:01,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:01,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:01,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:01,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:01,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:01,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:03,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:03,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-23 19:52:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-23 19:52:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-23 19:52:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:52:03,819 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-09-23 19:52:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:05,753 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-23 19:52:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 19:52:05,753 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-09-23 19:52:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:05,754 INFO L225 Difference]: With dead ends: 195 [2018-09-23 19:52:05,754 INFO L226 Difference]: Without dead ends: 194 [2018-09-23 19:52:05,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:52:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-23 19:52:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-23 19:52:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-23 19:52:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-23 19:52:05,791 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-23 19:52:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:05,792 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-23 19:52:05,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-23 19:52:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-23 19:52:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-23 19:52:05,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:05,793 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-23 19:52:05,793 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:05,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-23 19:52:05,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:05,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:05,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:06,834 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:06,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:06,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:06,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:06,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:06,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:06,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:08,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:08,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-23 19:52:08,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-23 19:52:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-23 19:52:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:52:08,071 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-09-23 19:52:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:10,130 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-23 19:52:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 19:52:10,131 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-09-23 19:52:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:10,132 INFO L225 Difference]: With dead ends: 200 [2018-09-23 19:52:10,132 INFO L226 Difference]: Without dead ends: 199 [2018-09-23 19:52:10,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-09-23 19:52:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-23 19:52:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-23 19:52:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-23 19:52:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-23 19:52:10,161 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-23 19:52:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:10,161 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-23 19:52:10,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-23 19:52:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-23 19:52:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-23 19:52:10,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:10,162 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-23 19:52:10,162 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:10,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-23 19:52:10,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:10,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:10,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:11,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:11,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:11,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:11,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:11,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:11,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:11,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:11,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:11,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:11,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:12,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:12,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-23 19:52:12,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 19:52:12,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 19:52:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:52:12,467 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-09-23 19:52:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:14,556 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-23 19:52:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:52:14,556 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-09-23 19:52:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:14,557 INFO L225 Difference]: With dead ends: 205 [2018-09-23 19:52:14,557 INFO L226 Difference]: Without dead ends: 204 [2018-09-23 19:52:14,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:52:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-23 19:52:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-23 19:52:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-23 19:52:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-23 19:52:14,588 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-23 19:52:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:14,588 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-23 19:52:14,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 19:52:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-23 19:52:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-23 19:52:14,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:14,589 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-23 19:52:14,589 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:14,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-23 19:52:14,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:14,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:14,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:16,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:16,042 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:16,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-23 19:52:16,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:16,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:16,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:16,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:16,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:16,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:17,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:17,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-23 19:52:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 19:52:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 19:52:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:52:17,529 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-09-23 19:52:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:19,414 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-23 19:52:19,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 19:52:19,414 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-09-23 19:52:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:19,415 INFO L225 Difference]: With dead ends: 210 [2018-09-23 19:52:19,416 INFO L226 Difference]: Without dead ends: 209 [2018-09-23 19:52:19,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-09-23 19:52:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-23 19:52:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-23 19:52:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-23 19:52:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-23 19:52:19,457 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-23 19:52:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:19,457 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-23 19:52:19,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 19:52:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-23 19:52:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-23 19:52:19,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:19,458 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-23 19:52:19,459 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-23 19:52:19,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:19,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:19,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:20,706 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:20,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:20,853 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:20,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:20,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:20,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:20,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:20,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:20,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:22,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:22,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-23 19:52:22,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 19:52:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 19:52:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:52:22,103 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-09-23 19:52:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:24,113 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-23 19:52:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-23 19:52:24,113 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-09-23 19:52:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:24,114 INFO L225 Difference]: With dead ends: 215 [2018-09-23 19:52:24,114 INFO L226 Difference]: Without dead ends: 214 [2018-09-23 19:52:24,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 19:52:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-23 19:52:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-23 19:52:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-23 19:52:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-23 19:52:24,151 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-23 19:52:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:24,152 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-23 19:52:24,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 19:52:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-23 19:52:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-23 19:52:24,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:24,153 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-23 19:52:24,153 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:24,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-23 19:52:24,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:24,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:25,679 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:25,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:26,082 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-23 19:52:26,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:26,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:26,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:26,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:26,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:26,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:27,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:27,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-23 19:52:27,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-23 19:52:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-23 19:52:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 19:52:27,437 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-09-23 19:52:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:29,573 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-23 19:52:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-23 19:52:29,574 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-09-23 19:52:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:29,575 INFO L225 Difference]: With dead ends: 220 [2018-09-23 19:52:29,575 INFO L226 Difference]: Without dead ends: 219 [2018-09-23 19:52:29,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-09-23 19:52:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-23 19:52:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-23 19:52:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-23 19:52:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-23 19:52:29,618 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-23 19:52:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:29,619 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-23 19:52:29,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-23 19:52:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-23 19:52:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-23 19:52:29,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:29,620 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-23 19:52:29,620 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:29,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-23 19:52:29,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:29,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:29,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:29,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:29,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:30,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:30,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:30,920 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:31,194 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-23 19:52:31,194 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:31,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:31,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:31,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:32,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:32,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-23 19:52:32,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-23 19:52:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-23 19:52:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 19:52:32,526 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-09-23 19:52:32,878 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:52:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:35,409 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-23 19:52:35,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-23 19:52:35,409 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-09-23 19:52:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:35,410 INFO L225 Difference]: With dead ends: 225 [2018-09-23 19:52:35,411 INFO L226 Difference]: Without dead ends: 224 [2018-09-23 19:52:35,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:52:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-23 19:52:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-23 19:52:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-23 19:52:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-23 19:52:35,448 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-23 19:52:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:35,448 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-23 19:52:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-23 19:52:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-23 19:52:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-23 19:52:35,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:35,449 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-23 19:52:35,449 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:35,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-23 19:52:35,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:35,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:36,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:36,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:36,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:36,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:37,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:37,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:37,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:37,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:38,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:38,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-23 19:52:38,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 19:52:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 19:52:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:52:38,384 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-09-23 19:52:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:40,781 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-23 19:52:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 19:52:40,782 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-09-23 19:52:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:40,783 INFO L225 Difference]: With dead ends: 230 [2018-09-23 19:52:40,783 INFO L226 Difference]: Without dead ends: 229 [2018-09-23 19:52:40,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-09-23 19:52:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-23 19:52:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-23 19:52:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-23 19:52:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-23 19:52:40,833 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-23 19:52:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:40,833 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-23 19:52:40,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 19:52:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-23 19:52:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-23 19:52:40,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:40,835 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-23 19:52:40,835 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:40,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-23 19:52:40,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:40,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:42,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:42,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:42,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:42,204 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:42,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:42,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:42,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:42,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:42,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:42,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:43,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:43,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-23 19:52:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-23 19:52:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-23 19:52:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:52:43,904 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-09-23 19:52:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:46,465 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-23 19:52:46,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 19:52:46,465 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-09-23 19:52:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:46,466 INFO L225 Difference]: With dead ends: 235 [2018-09-23 19:52:46,466 INFO L226 Difference]: Without dead ends: 234 [2018-09-23 19:52:46,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 19:52:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-23 19:52:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-23 19:52:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-23 19:52:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-23 19:52:46,527 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-23 19:52:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:46,527 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-23 19:52:46,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-23 19:52:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-23 19:52:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-23 19:52:46,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:46,529 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-23 19:52:46,529 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:46,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-23 19:52:46,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:46,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:46,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:48,046 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:48,046 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:48,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-23 19:52:48,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:48,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:48,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:48,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:48,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:48,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:49,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:49,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-23 19:52:49,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-23 19:52:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-23 19:52:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:52:49,899 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-09-23 19:52:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:52,574 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-23 19:52:52,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 19:52:52,575 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-09-23 19:52:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:52,576 INFO L225 Difference]: With dead ends: 240 [2018-09-23 19:52:52,576 INFO L226 Difference]: Without dead ends: 239 [2018-09-23 19:52:52,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-09-23 19:52:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-23 19:52:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-23 19:52:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-23 19:52:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-23 19:52:52,640 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-23 19:52:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:52,640 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-23 19:52:52,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-23 19:52:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-23 19:52:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-23 19:52:52,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:52,642 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-23 19:52:52,642 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:52,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-23 19:52:52,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:52,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:52,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:53,982 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:53,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:53,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:54,148 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:54,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:54,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:54,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:54,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:54,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:54,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:55,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:55,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-23 19:52:55,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-23 19:52:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-23 19:52:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:52:55,942 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-09-23 19:52:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:58,539 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-23 19:52:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:52:58,539 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-09-23 19:52:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:58,540 INFO L225 Difference]: With dead ends: 245 [2018-09-23 19:52:58,541 INFO L226 Difference]: Without dead ends: 244 [2018-09-23 19:52:58,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:52:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-23 19:52:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-23 19:52:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-23 19:52:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-23 19:52:58,589 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-23 19:52:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:58,590 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-23 19:52:58,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-23 19:52:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-23 19:52:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-23 19:52:58,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:58,591 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-23 19:52:58,591 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:52:58,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-23 19:52:58,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:58,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:58,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:00,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:00,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:53:00,454 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-23 19:53:00,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:00,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:00,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:00,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:00,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:00,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:02,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:02,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-23 19:53:02,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 19:53:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 19:53:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:53:02,323 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-09-23 19:53:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:04,982 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-23 19:53:04,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-23 19:53:04,982 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-09-23 19:53:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:04,984 INFO L225 Difference]: With dead ends: 250 [2018-09-23 19:53:04,984 INFO L226 Difference]: Without dead ends: 249 [2018-09-23 19:53:04,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-09-23 19:53:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-23 19:53:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-23 19:53:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-23 19:53:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-23 19:53:05,030 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-23 19:53:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:05,030 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-23 19:53:05,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 19:53:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-23 19:53:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-23 19:53:05,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:05,032 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-23 19:53:05,032 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:05,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-23 19:53:05,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:05,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:06,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:06,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:07,143 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-23 19:53:07,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:07,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:07,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:07,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:07,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:07,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:09,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:09,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-23 19:53:09,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-23 19:53:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-23 19:53:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:53:09,007 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-09-23 19:53:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:12,011 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-23 19:53:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 19:53:12,012 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-09-23 19:53:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:12,013 INFO L225 Difference]: With dead ends: 255 [2018-09-23 19:53:12,013 INFO L226 Difference]: Without dead ends: 254 [2018-09-23 19:53:12,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 19:53:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-23 19:53:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-23 19:53:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-23 19:53:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-23 19:53:12,074 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-23 19:53:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:12,075 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-23 19:53:12,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-23 19:53:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-23 19:53:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-23 19:53:12,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:12,077 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-23 19:53:12,077 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:12,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-23 19:53:12,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:12,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:13,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:13,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:13,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:13,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:13,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:13,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:13,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:13,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:15,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:15,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-23 19:53:15,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-23 19:53:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-23 19:53:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:53:15,618 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-09-23 19:53:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:18,628 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-23 19:53:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 19:53:18,629 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-09-23 19:53:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:18,630 INFO L225 Difference]: With dead ends: 260 [2018-09-23 19:53:18,630 INFO L226 Difference]: Without dead ends: 259 [2018-09-23 19:53:18,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-09-23 19:53:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-23 19:53:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-23 19:53:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-23 19:53:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-23 19:53:18,693 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-23 19:53:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:18,694 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-23 19:53:18,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-23 19:53:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-23 19:53:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-23 19:53:18,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:18,695 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-23 19:53:18,695 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:18,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-23 19:53:18,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:18,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:18,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:20,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:20,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:20,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:53:20,326 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:53:20,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:20,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:20,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:20,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:20,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:20,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:22,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:22,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-23 19:53:22,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 19:53:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 19:53:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:53:22,364 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-09-23 19:53:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:25,078 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-23 19:53:25,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-23 19:53:25,079 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-09-23 19:53:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:25,080 INFO L225 Difference]: With dead ends: 265 [2018-09-23 19:53:25,080 INFO L226 Difference]: Without dead ends: 264 [2018-09-23 19:53:25,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-09-23 19:53:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-23 19:53:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-23 19:53:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-23 19:53:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-23 19:53:25,134 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-23 19:53:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:25,135 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-23 19:53:25,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 19:53:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-23 19:53:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-23 19:53:25,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:25,136 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-23 19:53:25,137 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:25,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-23 19:53:25,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:25,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:26,848 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:26,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:26,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:53:27,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-23 19:53:27,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:27,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:27,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:27,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:27,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:27,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:29,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:29,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-23 19:53:29,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-23 19:53:29,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-23 19:53:29,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:53:29,087 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-09-23 19:53:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:32,210 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-23 19:53:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 19:53:32,210 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-09-23 19:53:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:32,211 INFO L225 Difference]: With dead ends: 270 [2018-09-23 19:53:32,211 INFO L226 Difference]: Without dead ends: 269 [2018-09-23 19:53:32,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-09-23 19:53:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-23 19:53:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-23 19:53:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-23 19:53:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-23 19:53:32,274 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-23 19:53:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:32,274 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-23 19:53:32,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-23 19:53:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-23 19:53:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-23 19:53:32,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:32,275 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-23 19:53:32,275 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:32,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-23 19:53:32,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:32,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:32,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:33,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:33,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:53:34,019 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:53:34,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:34,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:34,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:34,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:34,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:34,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:35,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:35,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-23 19:53:35,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-23 19:53:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-23 19:53:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:53:35,926 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-09-23 19:53:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:39,111 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-23 19:53:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 19:53:39,111 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-09-23 19:53:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:39,112 INFO L225 Difference]: With dead ends: 275 [2018-09-23 19:53:39,113 INFO L226 Difference]: Without dead ends: 274 [2018-09-23 19:53:39,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-09-23 19:53:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-23 19:53:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-23 19:53:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-23 19:53:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-23 19:53:39,168 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-23 19:53:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:39,168 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-23 19:53:39,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-23 19:53:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-23 19:53:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-23 19:53:39,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:39,170 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-23 19:53:39,170 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:39,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-23 19:53:39,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:39,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:40,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:40,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:40,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:53:41,157 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-23 19:53:41,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:41,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:41,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:41,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:41,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:41,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:43,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:43,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-23 19:53:43,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-23 19:53:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-23 19:53:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 19:53:43,316 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-09-23 19:53:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:46,436 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-23 19:53:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-23 19:53:46,437 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-09-23 19:53:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:46,438 INFO L225 Difference]: With dead ends: 280 [2018-09-23 19:53:46,438 INFO L226 Difference]: Without dead ends: 279 [2018-09-23 19:53:46,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-09-23 19:53:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-23 19:53:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-23 19:53:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-23 19:53:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-23 19:53:46,508 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-23 19:53:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:46,508 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-23 19:53:46,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-23 19:53:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-23 19:53:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-23 19:53:46,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:46,510 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-23 19:53:46,510 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:46,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-23 19:53:46,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:46,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:48,203 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:48,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:48,602 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-23 19:53:48,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:48,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:48,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:48,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:50,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:50,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-23 19:53:50,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-23 19:53:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-23 19:53:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:53:50,670 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-09-23 19:53:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:54,100 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-23 19:53:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 19:53:54,101 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-09-23 19:53:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:54,102 INFO L225 Difference]: With dead ends: 285 [2018-09-23 19:53:54,102 INFO L226 Difference]: Without dead ends: 284 [2018-09-23 19:53:54,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-09-23 19:53:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-23 19:53:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-23 19:53:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-23 19:53:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-23 19:53:54,165 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-23 19:53:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:54,165 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-23 19:53:54,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-23 19:53:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-23 19:53:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-23 19:53:54,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:54,166 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-23 19:53:54,167 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:53:54,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-23 19:53:54,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:54,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:54,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:54,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:54,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:55,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:55,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:55,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:56,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:56,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:56,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:56,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:56,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:58,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:58,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-23 19:53:58,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 19:53:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 19:53:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:53:58,390 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-09-23 19:54:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:01,692 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-23 19:54:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-23 19:54:01,693 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-09-23 19:54:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:01,694 INFO L225 Difference]: With dead ends: 290 [2018-09-23 19:54:01,694 INFO L226 Difference]: Without dead ends: 289 [2018-09-23 19:54:01,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-09-23 19:54:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-23 19:54:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-23 19:54:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-23 19:54:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-23 19:54:01,758 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-23 19:54:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:01,759 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-23 19:54:01,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 19:54:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-23 19:54:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-23 19:54:01,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:01,760 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-23 19:54:01,760 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:54:01,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-23 19:54:01,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:01,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:01,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:54:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:03,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:03,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:54:03,935 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:54:03,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:03,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:03,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:03,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:03,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:03,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:06,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:06,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-23 19:54:06,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-23 19:54:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-23 19:54:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:54:06,100 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-09-23 19:54:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:09,686 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-23 19:54:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-23 19:54:09,686 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-09-23 19:54:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:09,687 INFO L225 Difference]: With dead ends: 295 [2018-09-23 19:54:09,687 INFO L226 Difference]: Without dead ends: 294 [2018-09-23 19:54:09,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-09-23 19:54:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-23 19:54:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-23 19:54:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-23 19:54:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-23 19:54:09,755 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-23 19:54:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:09,755 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-23 19:54:09,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-23 19:54:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-23 19:54:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-23 19:54:09,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:09,756 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-23 19:54:09,756 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:54:09,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-23 19:54:09,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:09,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:09,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:11,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:11,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:54:11,952 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-23 19:54:11,952 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:11,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:11,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:11,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:11,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:11,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:14,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:14,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-23 19:54:14,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-23 19:54:14,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-23 19:54:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 19:54:14,369 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-09-23 19:54:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:18,024 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-23 19:54:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-23 19:54:18,024 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-09-23 19:54:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:18,025 INFO L225 Difference]: With dead ends: 300 [2018-09-23 19:54:18,025 INFO L226 Difference]: Without dead ends: 299 [2018-09-23 19:54:18,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-09-23 19:54:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-23 19:54:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-23 19:54:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-23 19:54:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-23 19:54:18,102 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-23 19:54:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:18,102 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-23 19:54:18,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-23 19:54:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-23 19:54:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-23 19:54:18,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:18,104 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-23 19:54:18,104 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:54:18,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-23 19:54:18,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:18,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:18,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:19,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:19,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:19,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:54:20,094 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:54:20,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:20,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:20,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:20,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:20,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:20,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:22,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:22,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-23 19:54:22,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-23 19:54:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-23 19:54:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:54:22,332 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-09-23 19:54:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:26,022 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-23 19:54:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-23 19:54:26,022 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-09-23 19:54:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:26,023 INFO L225 Difference]: With dead ends: 305 [2018-09-23 19:54:26,023 INFO L226 Difference]: Without dead ends: 304 [2018-09-23 19:54:26,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-09-23 19:54:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-23 19:54:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-23 19:54:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-23 19:54:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-23 19:54:26,093 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-23 19:54:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:26,093 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-23 19:54:26,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-23 19:54:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-23 19:54:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-23 19:54:26,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:26,095 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-23 19:54:26,095 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:54:26,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-23 19:54:26,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:26,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:26,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:26,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:26,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:28,032 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:28,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:54:28,450 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-23 19:54:28,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:28,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:28,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:28,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:28,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:28,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:30,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:30,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-23 19:54:30,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-23 19:54:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-23 19:54:30,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 19:54:30,760 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-09-23 19:54:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:34,624 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-23 19:54:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-23 19:54:34,624 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-09-23 19:54:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:34,626 INFO L225 Difference]: With dead ends: 310 [2018-09-23 19:54:34,626 INFO L226 Difference]: Without dead ends: 309 [2018-09-23 19:54:34,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-09-23 19:54:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-23 19:54:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-09-23 19:54:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-23 19:54:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-23 19:54:34,733 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-09-23 19:54:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:34,734 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-23 19:54:34,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-23 19:54:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-23 19:54:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-23 19:54:34,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:34,735 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-09-23 19:54:34,735 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-23 19:54:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-09-23 19:54:34,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:34,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:36,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:36,653 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:36,662 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:54:37,147 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-23 19:54:37,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:37,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:37,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:37,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:37,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:37,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-23 19:54:38,915 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-23 19:54:39,116 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:39,116 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:54:39,122 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:54:39,123 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:54:39 BoogieIcfgContainer [2018-09-23 19:54:39,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:54:39,124 INFO L168 Benchmark]: Toolchain (without parser) took 239463.94 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:39,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:39,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:39,125 INFO L168 Benchmark]: Boogie Preprocessor took 25.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:39,125 INFO L168 Benchmark]: RCFGBuilder took 445.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:54:39,126 INFO L168 Benchmark]: TraceAbstraction took 238932.20 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:39,127 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 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. * Boogie Procedure Inliner took 55.53 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. * Boogie Preprocessor took 25.13 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. * RCFGBuilder took 445.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238932.20 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 116 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 116 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 238.8s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 99.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 10665 SDslu, 197 SDs, 0 SdLazy, 16677 SolverSat, 5351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12872 GetRequests, 7200 SyntacticMatches, 0 SemanticMatches, 5672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224732 ImplicationChecksByTransitivity, 176.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 116.7s InterpolantComputationTime, 18307 NumberOfCodeBlocks, 18307 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18186 ConstructedInterpolants, 0 QuantifiedInterpolants, 29486531 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39176 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-54-39-135.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-54-39-135.csv Completed graceful shutdown