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_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:54:14,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:54:14,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:54:14,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:54:14,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:54:14,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:54:14,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:54:14,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:54:14,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:54:14,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:54:14,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:54:14,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:54:14,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:54:14,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:54:14,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:54:14,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:54:14,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:54:14,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:54:14,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:54:14,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:54:14,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:54:14,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:54:14,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:54:14,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:54:14,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:54:14,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:54:14,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:54:14,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:54:14,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:54:14,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:54:14,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:54:14,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:54:14,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:54:14,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:54:14,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:54:14,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:54:14,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:54:14,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:54:14,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:54:14,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:54:14,409 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:54:14,409 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:54:14,409 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:54:14,410 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:54:14,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:54:14,410 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:54:14,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:54:14,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:54:14,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:54:14,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:54:14,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:54:14,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:54:14,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:54:14,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:54:14,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:54:14,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:54:14,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:54:14,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:54:14,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:54:14,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:54:14,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:54:14,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:54:14,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:54:14,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:54:14,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:54:14,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:54:14,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:54:14,419 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:54:14,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:54:14,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:54:14,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:54:14,497 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:54:14,498 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:54:14,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-10-04 12:54:14,499 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-10-04 12:54:14,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:54:14,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:54:14,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:54:14,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:54:14,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:54:14,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,604 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:54:14,605 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:54:14,605 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:54:14,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:54:14,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:54:14,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:54:14,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:54:14,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/1) ... [2018-10-04 12:54:14,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:54:14,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:54:14,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:54:14,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:54:14,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (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-10-04 12:54:14,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:54:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:54:14,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:54:14,967 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:54:14,968 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:54:14 BoogieIcfgContainer [2018-10-04 12:54:14,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:54:14,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:54:14,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:54:14,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:54:14,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:14" (1/2) ... [2018-10-04 12:54:14,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a824d82 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:54:14, skipping insertion in model container [2018-10-04 12:54:14,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:54:14" (2/2) ... [2018-10-04 12:54:14,976 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-10-04 12:54:14,985 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:54:14,993 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-04 12:54:15,048 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:54:15,049 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:54:15,049 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:54:15,049 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:54:15,049 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:54:15,050 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:54:15,050 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:54:15,050 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:54:15,050 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:54:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 12:54:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:54:15,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:15,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:54:15,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:15,083 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-10-04 12:54:15,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:15,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:54:15,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:54:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:54:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:54:15,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:15,239 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 12:54:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:15,329 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-04 12:54:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:54:15,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:54:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:15,361 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:54:15,361 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:54:15,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:54:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:54:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:54:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:54:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-04 12:54:15,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2018-10-04 12:54:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:15,422 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-04 12:54:15,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:54:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 12:54:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:54:15,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:15,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:54:15,424 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:15,424 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 28755427, now seen corresponding path program 1 times [2018-10-04 12:54:15,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:15,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:15,524 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-10-04 12:54:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:15,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:54:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-04 12:54:15,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:54:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:54:15,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:15,632 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-04 12:54:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:15,699 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:54:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:54:15,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:54:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:15,701 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:54:15,701 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:54:15,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:54:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:54:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-10-04 12:54:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:54:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-10-04 12:54:15,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2018-10-04 12:54:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:15,706 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-10-04 12:54:15,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:54:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-10-04 12:54:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:54:15,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:15,707 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:54:15,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:15,708 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash 223461163, now seen corresponding path program 1 times [2018-10-04 12:54:15,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:15,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:15,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:15,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:15,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:54:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:15,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:54:15,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:54:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:54:15,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:15,891 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2018-10-04 12:54:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:16,019 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-04 12:54:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:54:16,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-04 12:54:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:16,021 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:54:16,021 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:54:16,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:54:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:54:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:54:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:54:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-04 12:54:16,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2018-10-04 12:54:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:16,028 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-04 12:54:16,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:54:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-04 12:54:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:54:16,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:16,029 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:54:16,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:16,030 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash -4275986, now seen corresponding path program 2 times [2018-10-04 12:54:16,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:16,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:16,161 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-10-04 12:54:16,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:16,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:16,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:16,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:16,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:16,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:54:16,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:54:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:54:16,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:16,417 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-10-04 12:54:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:16,480 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-10-04 12:54:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:54:16,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-04 12:54:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:16,483 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:54:16,483 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:54:16,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-04 12:54:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:54:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:54:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:54:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-10-04 12:54:16,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-10-04 12:54:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:16,488 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-10-04 12:54:16,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:54:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-10-04 12:54:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:54:16,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:16,489 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:54:16,490 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:16,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 183655921, now seen corresponding path program 3 times [2018-10-04 12:54:16,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:16,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:16,598 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-10-04 12:54:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:16,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:54:16,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:16,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 12:54:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-04 12:54:16,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:54:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:54:16,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:16,811 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2018-10-04 12:54:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:16,873 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-04 12:54:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:54:16,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 12:54:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:16,876 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:54:16,877 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:54:16,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:54:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:54:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-04 12:54:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:54:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-04 12:54:16,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-10-04 12:54:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:16,884 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-04 12:54:16,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:54:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-04 12:54:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:54:16,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:16,885 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:54:16,886 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:16,886 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -166307655, now seen corresponding path program 4 times [2018-10-04 12:54:16,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:16,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:16,980 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-10-04 12:54:16,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:16,997 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:16,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:16,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:17,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:17,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:54:17,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:54:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:54:17,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:17,108 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2018-10-04 12:54:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:17,374 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-10-04 12:54:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:54:17,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-10-04 12:54:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:17,376 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:54:17,376 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:54:17,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:54:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:54:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:54:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:54:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-04 12:54:17,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-10-04 12:54:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:17,387 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-04 12:54:17,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:54:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-10-04 12:54:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:54:17,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:17,390 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:54:17,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:17,390 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851644, now seen corresponding path program 5 times [2018-10-04 12:54:17,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:17,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:17,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:17,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:17,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:17,674 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-10-04 12:54:17,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:17,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:54:17,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:17,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:17,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:54:17,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:54:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:54:17,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:17,778 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2018-10-04 12:54:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:17,822 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-10-04 12:54:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:54:17,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-04 12:54:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:17,824 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:54:17,824 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:54:17,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:54:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:54:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:54:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:54:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-10-04 12:54:17,829 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2018-10-04 12:54:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:17,830 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-04 12:54:17,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:54:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-10-04 12:54:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:54:17,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:17,831 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1] [2018-10-04 12:54:17,831 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:17,831 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1025954175, now seen corresponding path program 6 times [2018-10-04 12:54:17,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:17,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:18,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:18,024 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-10-04 12:54:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:18,147 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 12:54:18,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:18,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:18,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-10-04 12:54:18,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:54:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:54:18,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:18,385 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 19 states. [2018-10-04 12:54:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:18,696 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-10-04 12:54:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:54:18,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 12:54:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:18,698 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:54:18,698 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:54:18,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 17 [2018-10-04 12:54:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:54:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-04 12:54:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:54:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-10-04 12:54:18,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2018-10-04 12:54:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:18,705 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-10-04 12:54:18,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:54:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-10-04 12:54:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:54:18,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:18,706 INFO L375 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1] [2018-10-04 12:54:18,707 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:18,707 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -509505115, now seen corresponding path program 7 times [2018-10-04 12:54:18,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:18,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:18,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 12:54:18,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:18,838 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-10-04 12:54:18,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:18,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 12:54:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:54:19,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:54:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:54:19,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:19,016 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 11 states. [2018-10-04 12:54:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:19,085 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-10-04 12:54:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:54:19,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-04 12:54:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:19,087 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:54:19,087 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:54:19,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:54:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:54:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:54:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:54:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-10-04 12:54:19,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 37 [2018-10-04 12:54:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:19,094 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-10-04 12:54:19,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:54:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-10-04 12:54:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:54:19,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:19,096 INFO L375 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1] [2018-10-04 12:54:19,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:19,096 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash -431087384, now seen corresponding path program 8 times [2018-10-04 12:54:19,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:19,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:19,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:19,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:19,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 12:54:19,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:19,249 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-10-04 12:54:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:19,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:19,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:19,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 12:54:19,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:19,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:54:19,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:54:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:54:19,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:19,402 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2018-10-04 12:54:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:19,463 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-10-04 12:54:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:54:19,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-04 12:54:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:19,465 INFO L225 Difference]: With dead ends: 67 [2018-10-04 12:54:19,465 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:54:19,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 12:54:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:54:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:54:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:54:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-10-04 12:54:19,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 39 [2018-10-04 12:54:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:19,473 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-10-04 12:54:19,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:54:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-10-04 12:54:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:54:19,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:19,475 INFO L375 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1] [2018-10-04 12:54:19,475 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:19,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1913908075, now seen corresponding path program 9 times [2018-10-04 12:54:19,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:19,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 12:54:19,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:19,617 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-10-04 12:54:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:19,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-10-04 12:54:19,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:19,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:19,836 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 37 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:20,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:20,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-10-04 12:54:20,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:54:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:54:20,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:20,039 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 32 states. [2018-10-04 12:54:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:20,322 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2018-10-04 12:54:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:54:20,323 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-10-04 12:54:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:20,324 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:54:20,324 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 12:54:20,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 17 [2018-10-04 12:54:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 12:54:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-04 12:54:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 12:54:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2018-10-04 12:54:20,333 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 41 [2018-10-04 12:54:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:20,333 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-10-04 12:54:20,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:54:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-10-04 12:54:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:54:20,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:20,335 INFO L375 BasicCegarLoop]: trace histogram [30, 19, 11, 1, 1, 1] [2018-10-04 12:54:20,335 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:20,336 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2050603744, now seen corresponding path program 10 times [2018-10-04 12:54:20,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:20,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 12:54:20,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:20,618 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-10-04 12:54:20,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:20,663 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:20,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:20,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 12:54:20,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:20,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:54:20,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:54:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:54:20,780 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:20,780 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 14 states. [2018-10-04 12:54:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:20,876 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2018-10-04 12:54:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:54:20,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-04 12:54:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:20,877 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:54:20,877 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:54:20,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 12:54:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:54:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 12:54:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:54:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-10-04 12:54:20,885 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 63 [2018-10-04 12:54:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-10-04 12:54:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:54:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2018-10-04 12:54:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:54:20,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:20,887 INFO L375 BasicCegarLoop]: trace histogram [31, 19, 12, 1, 1, 1] [2018-10-04 12:54:20,888 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:20,888 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 335902371, now seen corresponding path program 11 times [2018-10-04 12:54:20,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:20,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 12:54:21,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:21,396 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-10-04 12:54:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:21,618 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-10-04 12:54:21,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:21,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 12:54:21,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:21,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:54:21,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:54:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:54:21,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:21,770 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 15 states. [2018-10-04 12:54:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:21,874 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-10-04 12:54:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:54:21,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-10-04 12:54:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:21,876 INFO L225 Difference]: With dead ends: 113 [2018-10-04 12:54:21,876 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:54:21,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 13 [2018-10-04 12:54:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:54:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 12:54:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 12:54:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2018-10-04 12:54:21,888 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 65 [2018-10-04 12:54:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:21,889 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-10-04 12:54:21,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:54:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2018-10-04 12:54:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:54:21,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:21,890 INFO L375 BasicCegarLoop]: trace histogram [32, 19, 13, 1, 1, 1] [2018-10-04 12:54:21,890 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:21,890 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 255742822, now seen corresponding path program 12 times [2018-10-04 12:54:21,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:21,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 518 proven. 182 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 12:54:22,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:22,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:22,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:22,235 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-10-04 12:54:22,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:22,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:22,311 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 507 proven. 361 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 12:54:22,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:22,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 36 [2018-10-04 12:54:22,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:54:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:54:22,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:22,541 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 36 states. [2018-10-04 12:54:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:22,837 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2018-10-04 12:54:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:54:22,837 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-10-04 12:54:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:22,839 INFO L225 Difference]: With dead ends: 118 [2018-10-04 12:54:22,839 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:54:22,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-04 12:54:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:54:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-04 12:54:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:54:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2018-10-04 12:54:22,847 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 67 [2018-10-04 12:54:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:22,848 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2018-10-04 12:54:22,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:54:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-10-04 12:54:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:54:22,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:22,849 INFO L375 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1] [2018-10-04 12:54:22,850 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:22,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -15063890, now seen corresponding path program 13 times [2018-10-04 12:54:22,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:22,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:22,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:22,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:23,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:23,343 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-10-04 12:54:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:23,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:23,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:23,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:54:23,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:54:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:54:23,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:23,639 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 17 states. [2018-10-04 12:54:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:23,708 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-10-04 12:54:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:54:23,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-10-04 12:54:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:23,710 INFO L225 Difference]: With dead ends: 121 [2018-10-04 12:54:23,710 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 12:54:23,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 15 [2018-10-04 12:54:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 12:54:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 12:54:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:54:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-10-04 12:54:23,716 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 71 [2018-10-04 12:54:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:23,717 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-10-04 12:54:23,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:54:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-10-04 12:54:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:54:23,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:23,718 INFO L375 BasicCegarLoop]: trace histogram [35, 20, 15, 1, 1, 1] [2018-10-04 12:54:23,719 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:23,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash -694344911, now seen corresponding path program 14 times [2018-10-04 12:54:23,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:23,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:23,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:23,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:23,981 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-10-04 12:54:23,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:24,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:24,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:24,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:24,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:24,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:54:24,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:54:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:54:24,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:24,332 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand 18 states. [2018-10-04 12:54:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:24,404 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-10-04 12:54:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:54:24,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2018-10-04 12:54:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:24,406 INFO L225 Difference]: With dead ends: 123 [2018-10-04 12:54:24,406 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:54:24,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 16 [2018-10-04 12:54:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:54:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 12:54:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:54:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2018-10-04 12:54:24,412 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 73 [2018-10-04 12:54:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:24,413 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2018-10-04 12:54:24,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:54:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2018-10-04 12:54:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:54:24,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:24,415 INFO L375 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1] [2018-10-04 12:54:24,415 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:24,415 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -648377100, now seen corresponding path program 15 times [2018-10-04 12:54:24,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:24,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:24,665 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-10-04 12:54:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:24,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-04 12:54:24,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:24,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 12:54:24,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:54:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:54:24,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:24,825 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand 19 states. [2018-10-04 12:54:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:24,890 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-10-04 12:54:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:54:24,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-10-04 12:54:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:24,891 INFO L225 Difference]: With dead ends: 125 [2018-10-04 12:54:24,891 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:54:24,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:54:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:54:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:54:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:54:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2018-10-04 12:54:24,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 75 [2018-10-04 12:54:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:24,897 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2018-10-04 12:54:24,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:54:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2018-10-04 12:54:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:54:24,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:24,898 INFO L375 BasicCegarLoop]: trace histogram [37, 20, 17, 1, 1, 1] [2018-10-04 12:54:24,899 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:24,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash 577016311, now seen corresponding path program 16 times [2018-10-04 12:54:24,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:24,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:24,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:25,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:25,523 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-10-04 12:54:25,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:25,559 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:25,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:25,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:25,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:25,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:54:25,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:54:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:54:25,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:25,707 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 20 states. [2018-10-04 12:54:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:25,809 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2018-10-04 12:54:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:54:25,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-10-04 12:54:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:25,810 INFO L225 Difference]: With dead ends: 127 [2018-10-04 12:54:25,810 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:54:25,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 18 [2018-10-04 12:54:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:54:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 12:54:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:54:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2018-10-04 12:54:25,816 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 77 [2018-10-04 12:54:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:25,816 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2018-10-04 12:54:25,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:54:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-10-04 12:54:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 12:54:25,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:25,819 INFO L375 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1] [2018-10-04 12:54:25,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:25,819 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1359045178, now seen corresponding path program 17 times [2018-10-04 12:54:25,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:25,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:25,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:25,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:26,078 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:26,088 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-10-04 12:54:26,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:26,143 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2018-10-04 12:54:26,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:26,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:26,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:26,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:54:26,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:54:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:54:26,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:26,360 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 21 states. [2018-10-04 12:54:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:26,435 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2018-10-04 12:54:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:54:26,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-04 12:54:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:26,438 INFO L225 Difference]: With dead ends: 129 [2018-10-04 12:54:26,438 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 12:54:26,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 12:54:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 12:54:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-04 12:54:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 12:54:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-10-04 12:54:26,443 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 79 [2018-10-04 12:54:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:26,444 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-10-04 12:54:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:54:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-10-04 12:54:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:54:26,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:26,445 INFO L375 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1] [2018-10-04 12:54:26,446 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:26,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1269509565, now seen corresponding path program 18 times [2018-10-04 12:54:26,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:26,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:26,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:27,381 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 12:54:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:27,399 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-10-04 12:54:27,406 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:27,445 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-04 12:54:27,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:27,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:27,636 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 779 proven. 400 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 12:54:27,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:27,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2018-10-04 12:54:27,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:54:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:54:27,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:27,720 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 43 states. [2018-10-04 12:54:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:27,992 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2018-10-04 12:54:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:54:27,992 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2018-10-04 12:54:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:27,993 INFO L225 Difference]: With dead ends: 134 [2018-10-04 12:54:27,993 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 12:54:27,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 13 [2018-10-04 12:54:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 12:54:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-04 12:54:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 12:54:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-10-04 12:54:27,999 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-10-04 12:54:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:27,999 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-10-04 12:54:27,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:54:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-10-04 12:54:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:54:28,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:28,000 INFO L375 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1] [2018-10-04 12:54:28,001 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:28,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1080732667, now seen corresponding path program 19 times [2018-10-04 12:54:28,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:28,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:28,466 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 12:54:28,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:28,480 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-10-04 12:54:28,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:28,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 12:54:28,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:28,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:54:28,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:54:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:54:28,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:28,610 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 23 states. [2018-10-04 12:54:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:28,675 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2018-10-04 12:54:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:54:28,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-04 12:54:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:28,683 INFO L225 Difference]: With dead ends: 137 [2018-10-04 12:54:28,683 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 12:54:28,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-04 12:54:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 12:54:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-04 12:54:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 12:54:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-10-04 12:54:28,688 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 85 [2018-10-04 12:54:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:28,689 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2018-10-04 12:54:28,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:54:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2018-10-04 12:54:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:54:28,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:28,690 INFO L375 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1] [2018-10-04 12:54:28,690 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:28,690 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -95735480, now seen corresponding path program 20 times [2018-10-04 12:54:28,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:28,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:28,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:28,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:28,922 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 12:54:28,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:28,970 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-10-04 12:54:28,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:29,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:29,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:29,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 12:54:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:54:29,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:54:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:54:29,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:29,210 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 24 states. [2018-10-04 12:54:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:29,330 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-10-04 12:54:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:54:29,333 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-10-04 12:54:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:29,334 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:54:29,334 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 12:54:29,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 12:54:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 12:54:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 12:54:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 12:54:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-10-04 12:54:29,337 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 87 [2018-10-04 12:54:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:29,337 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-10-04 12:54:29,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:54:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2018-10-04 12:54:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 12:54:29,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:29,338 INFO L375 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1] [2018-10-04 12:54:29,339 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:29,339 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1593756107, now seen corresponding path program 21 times [2018-10-04 12:54:29,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:29,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:29,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:29,614 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 943 proven. 506 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 12:54:29,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:29,666 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-10-04 12:54:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:29,729 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-10-04 12:54:29,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:29,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:29,908 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:30,075 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 85 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:30,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:30,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45] total 68 [2018-10-04 12:54:30,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:54:30,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:54:30,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:30,336 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 68 states. [2018-10-04 12:54:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:30,994 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2018-10-04 12:54:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:54:30,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 89 [2018-10-04 12:54:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:30,995 INFO L225 Difference]: With dead ends: 186 [2018-10-04 12:54:30,995 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:54:30,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 23 [2018-10-04 12:54:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:54:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-04 12:54:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-04 12:54:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-10-04 12:54:31,000 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 89 [2018-10-04 12:54:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:31,000 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-10-04 12:54:31,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:54:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-10-04 12:54:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-04 12:54:31,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:31,001 INFO L375 BasicCegarLoop]: trace histogram [66, 43, 23, 1, 1, 1] [2018-10-04 12:54:31,001 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:31,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2117767484, now seen corresponding path program 22 times [2018-10-04 12:54:31,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:31,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:31,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:31,272 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 12:54:31,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:31,327 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-10-04 12:54:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:31,390 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:31,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:31,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 12:54:31,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:31,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:54:31,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:54:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:54:31,579 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:31,579 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 26 states. [2018-10-04 12:54:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:31,696 INFO L93 Difference]: Finished difference Result 231 states and 318 transitions. [2018-10-04 12:54:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:54:31,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2018-10-04 12:54:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:31,697 INFO L225 Difference]: With dead ends: 231 [2018-10-04 12:54:31,697 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 12:54:31,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 11 [2018-10-04 12:54:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 12:54:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-04 12:54:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-04 12:54:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2018-10-04 12:54:31,702 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 135 [2018-10-04 12:54:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:31,702 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2018-10-04 12:54:31,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:54:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2018-10-04 12:54:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-04 12:54:31,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:31,703 INFO L375 BasicCegarLoop]: trace histogram [67, 43, 24, 1, 1, 1] [2018-10-04 12:54:31,703 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:31,703 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash 130545599, now seen corresponding path program 23 times [2018-10-04 12:54:31,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:31,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:31,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:31,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:32,189 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 12:54:32,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:32,327 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-10-04 12:54:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:32,426 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2018-10-04 12:54:32,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:32,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 12:54:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:32,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:54:32,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:54:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:54:32,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:32,555 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand 27 states. [2018-10-04 12:54:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:32,722 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2018-10-04 12:54:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:54:32,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 137 [2018-10-04 12:54:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:32,723 INFO L225 Difference]: With dead ends: 233 [2018-10-04 12:54:32,723 INFO L226 Difference]: Without dead ends: 142 [2018-10-04 12:54:32,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 12 [2018-10-04 12:54:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-04 12:54:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-04 12:54:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-04 12:54:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2018-10-04 12:54:32,729 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 137 [2018-10-04 12:54:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:32,729 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2018-10-04 12:54:32,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:54:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2018-10-04 12:54:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-04 12:54:32,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:32,730 INFO L375 BasicCegarLoop]: trace histogram [68, 43, 25, 1, 1, 1] [2018-10-04 12:54:32,730 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:32,731 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1670760834, now seen corresponding path program 24 times [2018-10-04 12:54:32,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:32,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:32,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:32,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:32,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:33,762 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2210 proven. 650 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 12:54:33,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:33,926 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-10-04 12:54:33,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:34,032 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-10-04 12:54:34,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:34,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:34,150 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:34,324 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:34,800 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:54:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2175 proven. 1849 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 12:54:34,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2018-10-04 12:54:34,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:54:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:54:34,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:34,869 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 72 states. [2018-10-04 12:54:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:35,610 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2018-10-04 12:54:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:54:35,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2018-10-04 12:54:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:35,611 INFO L225 Difference]: With dead ends: 238 [2018-10-04 12:54:35,611 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:54:35,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.1s impTime 10 [2018-10-04 12:54:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:54:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-04 12:54:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 12:54:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-10-04 12:54:35,615 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 139 [2018-10-04 12:54:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:35,615 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-10-04 12:54:35,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:54:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-10-04 12:54:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-04 12:54:35,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:35,616 INFO L375 BasicCegarLoop]: trace histogram [70, 44, 26, 1, 1, 1] [2018-10-04 12:54:35,616 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:35,616 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 243202250, now seen corresponding path program 25 times [2018-10-04 12:54:35,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:35,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:35,953 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:36,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:36,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 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-10-04 12:54:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:36,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:54:36,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:54:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:54:36,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:36,316 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 29 states. [2018-10-04 12:54:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:36,487 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2018-10-04 12:54:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:54:36,488 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 143 [2018-10-04 12:54:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:36,489 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:54:36,489 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 12:54:36,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 14 [2018-10-04 12:54:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 12:54:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-10-04 12:54:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-04 12:54:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2018-10-04 12:54:36,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 143 [2018-10-04 12:54:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:36,495 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2018-10-04 12:54:36,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:54:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2018-10-04 12:54:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 12:54:36,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:36,496 INFO L375 BasicCegarLoop]: trace histogram [71, 44, 27, 1, 1, 1] [2018-10-04 12:54:36,496 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:36,497 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash -565498803, now seen corresponding path program 26 times [2018-10-04 12:54:36,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:36,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:36,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:37,091 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:37,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:37,398 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-10-04 12:54:37,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:37,464 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:37,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:37,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:37,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:37,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:54:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:54:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:54:37,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:37,667 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand 30 states. [2018-10-04 12:54:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:37,788 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2018-10-04 12:54:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:54:37,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 145 [2018-10-04 12:54:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:37,790 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:54:37,790 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 12:54:37,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 15 [2018-10-04 12:54:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 12:54:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-04 12:54:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-04 12:54:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2018-10-04 12:54:37,794 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 145 [2018-10-04 12:54:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:37,795 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2018-10-04 12:54:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:54:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2018-10-04 12:54:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 12:54:37,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:37,795 INFO L375 BasicCegarLoop]: trace histogram [72, 44, 28, 1, 1, 1] [2018-10-04 12:54:37,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:37,796 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -338130160, now seen corresponding path program 27 times [2018-10-04 12:54:37,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:37,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:37,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:38,141 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:38,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:38,384 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-10-04 12:54:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:38,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-10-04 12:54:38,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:38,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:38,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:38,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:54:38,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:54:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:54:38,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:38,640 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 31 states. [2018-10-04 12:54:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:38,775 INFO L93 Difference]: Finished difference Result 245 states and 334 transitions. [2018-10-04 12:54:38,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:54:38,776 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-10-04 12:54:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:38,777 INFO L225 Difference]: With dead ends: 245 [2018-10-04 12:54:38,777 INFO L226 Difference]: Without dead ends: 152 [2018-10-04 12:54:38,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 16 [2018-10-04 12:54:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-04 12:54:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-04 12:54:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 12:54:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2018-10-04 12:54:38,782 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 147 [2018-10-04 12:54:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:38,782 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2018-10-04 12:54:38,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:54:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2018-10-04 12:54:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-04 12:54:38,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:38,783 INFO L375 BasicCegarLoop]: trace histogram [73, 44, 29, 1, 1, 1] [2018-10-04 12:54:38,784 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:38,784 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash -880196333, now seen corresponding path program 28 times [2018-10-04 12:54:38,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:38,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:38,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:38,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:38,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:39,130 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:39,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:39,367 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-10-04 12:54:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:39,451 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:39,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:39,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:54:39,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:54:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:54:39,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:39,605 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 32 states. [2018-10-04 12:54:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:40,322 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2018-10-04 12:54:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:54:40,323 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 149 [2018-10-04 12:54:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:40,324 INFO L225 Difference]: With dead ends: 247 [2018-10-04 12:54:40,324 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 12:54:40,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 17 [2018-10-04 12:54:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 12:54:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-04 12:54:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-04 12:54:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2018-10-04 12:54:40,330 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 149 [2018-10-04 12:54:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:40,331 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2018-10-04 12:54:40,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:54:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2018-10-04 12:54:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 12:54:40,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:40,332 INFO L375 BasicCegarLoop]: trace histogram [74, 44, 30, 1, 1, 1] [2018-10-04 12:54:40,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:40,332 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2114745770, now seen corresponding path program 29 times [2018-10-04 12:54:40,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:40,591 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:40,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:40,804 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-10-04 12:54:40,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:40,977 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2018-10-04 12:54:40,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:40,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:41,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:41,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:54:41,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:54:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:54:41,122 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:41,123 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand 33 states. [2018-10-04 12:54:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:41,255 INFO L93 Difference]: Finished difference Result 249 states and 338 transitions. [2018-10-04 12:54:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:54:41,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 151 [2018-10-04 12:54:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:41,257 INFO L225 Difference]: With dead ends: 249 [2018-10-04 12:54:41,257 INFO L226 Difference]: Without dead ends: 156 [2018-10-04 12:54:41,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 18 [2018-10-04 12:54:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-04 12:54:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-04 12:54:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 12:54:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2018-10-04 12:54:41,263 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 151 [2018-10-04 12:54:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:41,263 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2018-10-04 12:54:41,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:54:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2018-10-04 12:54:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-04 12:54:41,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:41,264 INFO L375 BasicCegarLoop]: trace histogram [75, 44, 31, 1, 1, 1] [2018-10-04 12:54:41,265 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:41,265 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1189186265, now seen corresponding path program 30 times [2018-10-04 12:54:41,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:41,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:41,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:41,715 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2784 proven. 992 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 12:54:41,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:41,854 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-10-04 12:54:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:41,964 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2018-10-04 12:54:41,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:41,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:42,124 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:42,537 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:42,793 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:54:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2759 proven. 1936 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 12:54:42,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:42,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 47] total 79 [2018-10-04 12:54:42,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:54:42,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:54:42,943 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:42,943 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand 79 states. [2018-10-04 12:54:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:43,851 INFO L93 Difference]: Finished difference Result 254 states and 346 transitions. [2018-10-04 12:54:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 12:54:43,851 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2018-10-04 12:54:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:43,852 INFO L225 Difference]: With dead ends: 254 [2018-10-04 12:54:43,852 INFO L226 Difference]: Without dead ends: 161 [2018-10-04 12:54:43,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 17 [2018-10-04 12:54:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-04 12:54:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-10-04 12:54:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-04 12:54:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2018-10-04 12:54:43,857 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 153 [2018-10-04 12:54:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:43,857 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2018-10-04 12:54:43,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:54:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-10-04 12:54:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-04 12:54:43,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:43,858 INFO L375 BasicCegarLoop]: trace histogram [77, 45, 32, 1, 1, 1] [2018-10-04 12:54:43,858 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:43,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1177907423, now seen corresponding path program 31 times [2018-10-04 12:54:43,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:43,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:44,397 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:44,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:44,705 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-10-04 12:54:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:44,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:44,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:44,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 12:54:44,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:54:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:54:44,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:44,925 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 35 states. [2018-10-04 12:54:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:45,055 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2018-10-04 12:54:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:54:45,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 157 [2018-10-04 12:54:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:45,057 INFO L225 Difference]: With dead ends: 257 [2018-10-04 12:54:45,057 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 12:54:45,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 20 [2018-10-04 12:54:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 12:54:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-04 12:54:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 12:54:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2018-10-04 12:54:45,063 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 157 [2018-10-04 12:54:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:45,063 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2018-10-04 12:54:45,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:54:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2018-10-04 12:54:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 12:54:45,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:45,064 INFO L375 BasicCegarLoop]: trace histogram [78, 45, 33, 1, 1, 1] [2018-10-04 12:54:45,064 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:45,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1509367452, now seen corresponding path program 32 times [2018-10-04 12:54:45,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:45,894 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:46,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:46,066 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-10-04 12:54:46,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:46,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:46,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:46,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:54:47,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:54:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:54:47,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:47,409 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand 36 states. [2018-10-04 12:54:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:47,584 INFO L93 Difference]: Finished difference Result 259 states and 350 transitions. [2018-10-04 12:54:47,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:54:47,584 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 159 [2018-10-04 12:54:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:47,585 INFO L225 Difference]: With dead ends: 259 [2018-10-04 12:54:47,586 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 12:54:47,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 0.6s impTime 21 [2018-10-04 12:54:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 12:54:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-04 12:54:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-04 12:54:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2018-10-04 12:54:47,591 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 159 [2018-10-04 12:54:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:47,591 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2018-10-04 12:54:47,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:54:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2018-10-04 12:54:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-04 12:54:47,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:47,593 INFO L375 BasicCegarLoop]: trace histogram [79, 45, 34, 1, 1, 1] [2018-10-04 12:54:47,593 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:47,593 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2080091879, now seen corresponding path program 33 times [2018-10-04 12:54:47,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:47,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:47,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:48,326 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:49,271 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:49,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:49,292 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-10-04 12:54:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:49,403 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-10-04 12:54:49,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:49,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:49,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:49,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 12:54:49,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:54:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:54:49,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:49,885 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 37 states. [2018-10-04 12:54:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:49,996 INFO L93 Difference]: Finished difference Result 261 states and 352 transitions. [2018-10-04 12:54:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:54:49,997 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 161 [2018-10-04 12:54:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:49,998 INFO L225 Difference]: With dead ends: 261 [2018-10-04 12:54:49,998 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 12:54:49,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.3s impTime 7 [2018-10-04 12:54:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 12:54:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 12:54:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 12:54:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2018-10-04 12:54:50,006 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 161 [2018-10-04 12:54:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:50,006 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2018-10-04 12:54:50,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:54:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2018-10-04 12:54:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 12:54:50,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:50,007 INFO L375 BasicCegarLoop]: trace histogram [80, 45, 35, 1, 1, 1] [2018-10-04 12:54:50,008 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:50,008 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1603197014, now seen corresponding path program 34 times [2018-10-04 12:54:50,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:50,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:50,652 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:50,906 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:50,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:50,934 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-10-04 12:54:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:50,993 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:50,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:50,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:51,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:51,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:54:51,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:54:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:54:51,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:51,175 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand 38 states. [2018-10-04 12:54:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:51,276 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2018-10-04 12:54:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:54:51,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 163 [2018-10-04 12:54:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:51,277 INFO L225 Difference]: With dead ends: 263 [2018-10-04 12:54:51,277 INFO L226 Difference]: Without dead ends: 168 [2018-10-04 12:54:51,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 8 [2018-10-04 12:54:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-04 12:54:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-10-04 12:54:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-04 12:54:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-04 12:54:51,282 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 163 [2018-10-04 12:54:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:51,283 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-04 12:54:51,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:54:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-04 12:54:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-04 12:54:51,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:51,284 INFO L375 BasicCegarLoop]: trace histogram [81, 45, 36, 1, 1, 1] [2018-10-04 12:54:51,284 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:51,284 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2104196013, now seen corresponding path program 35 times [2018-10-04 12:54:51,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:51,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:52,775 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:53,076 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:53,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:53,149 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-10-04 12:54:53,156 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:53,296 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2018-10-04 12:54:53,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:53,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:53,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:53,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:54:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:54:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:54:53,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:53,462 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 39 states. [2018-10-04 12:54:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:53,620 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2018-10-04 12:54:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:54:53,620 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 165 [2018-10-04 12:54:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:53,621 INFO L225 Difference]: With dead ends: 265 [2018-10-04 12:54:53,621 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 12:54:53,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 9 [2018-10-04 12:54:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 12:54:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-10-04 12:54:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-04 12:54:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2018-10-04 12:54:53,627 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 165 [2018-10-04 12:54:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:53,627 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2018-10-04 12:54:53,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:54:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2018-10-04 12:54:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-04 12:54:53,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:53,628 INFO L375 BasicCegarLoop]: trace histogram [82, 45, 37, 1, 1, 1] [2018-10-04 12:54:53,630 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:53,631 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:53,631 INFO L82 PathProgramCache]: Analyzing trace with hash 86039280, now seen corresponding path program 36 times [2018-10-04 12:54:53,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:53,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:53,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:53,957 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:54,368 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:54,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:54,458 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-10-04 12:54:54,465 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:54,577 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2018-10-04 12:54:54,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:54,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:55,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 12:54:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:54:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:54:55,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:55,776 INFO L87 Difference]: Start difference. First operand 170 states and 215 transitions. Second operand 40 states. [2018-10-04 12:54:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:55,883 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2018-10-04 12:54:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:54:55,883 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 167 [2018-10-04 12:54:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:55,884 INFO L225 Difference]: With dead ends: 267 [2018-10-04 12:54:55,884 INFO L226 Difference]: Without dead ends: 172 [2018-10-04 12:54:55,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.6s impTime 10 [2018-10-04 12:54:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-04 12:54:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-10-04 12:54:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-04 12:54:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2018-10-04 12:54:55,890 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 167 [2018-10-04 12:54:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:55,890 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2018-10-04 12:54:55,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:54:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2018-10-04 12:54:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-04 12:54:55,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:55,892 INFO L375 BasicCegarLoop]: trace histogram [83, 45, 38, 1, 1, 1] [2018-10-04 12:54:55,892 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:55,892 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1962636659, now seen corresponding path program 37 times [2018-10-04 12:54:55,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:55,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:57,025 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:57,626 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:57,978 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-10-04 12:54:57,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:58,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 12:54:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:54:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:54:58,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:58,244 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand 41 states. [2018-10-04 12:54:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:58,632 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2018-10-04 12:54:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:54:58,633 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-10-04 12:54:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:58,634 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:54:58,634 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 12:54:58,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.4s impTime 11 [2018-10-04 12:54:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 12:54:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-10-04 12:54:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-04 12:54:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2018-10-04 12:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 169 [2018-10-04 12:54:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:58,639 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2018-10-04 12:54:58,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:54:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2018-10-04 12:54:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-04 12:54:58,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:58,640 INFO L375 BasicCegarLoop]: trace histogram [84, 45, 39, 1, 1, 1] [2018-10-04 12:54:58,640 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:58,640 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1486453558, now seen corresponding path program 38 times [2018-10-04 12:54:58,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:58,912 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:54:59,272 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:54:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:59,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:59,453 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-10-04 12:54:59,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:59,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:59,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:59,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:54:59,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:59,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 12:54:59,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:54:59,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:54:59,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:59,767 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand 42 states. [2018-10-04 12:54:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:59,921 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2018-10-04 12:54:59,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:54:59,921 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-10-04 12:54:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:59,922 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:54:59,922 INFO L226 Difference]: Without dead ends: 176 [2018-10-04 12:54:59,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 12 [2018-10-04 12:54:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-04 12:54:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-04 12:54:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 12:54:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2018-10-04 12:54:59,926 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 171 [2018-10-04 12:54:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:59,927 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2018-10-04 12:54:59,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:54:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2018-10-04 12:54:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-04 12:54:59,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:59,928 INFO L375 BasicCegarLoop]: trace histogram [85, 45, 40, 1, 1, 1] [2018-10-04 12:54:59,928 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:59,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -858973127, now seen corresponding path program 39 times [2018-10-04 12:54:59,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:00,839 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:01,093 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:01,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:01,182 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-10-04 12:55:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:01,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2018-10-04 12:55:01,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:01,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:01,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 12:55:01,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:55:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:55:01,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:01,517 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand 43 states. [2018-10-04 12:55:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:01,640 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2018-10-04 12:55:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:55:01,641 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-10-04 12:55:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:01,642 INFO L225 Difference]: With dead ends: 273 [2018-10-04 12:55:01,642 INFO L226 Difference]: Without dead ends: 178 [2018-10-04 12:55:01,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 13 [2018-10-04 12:55:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-04 12:55:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-04 12:55:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-04 12:55:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2018-10-04 12:55:01,646 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 173 [2018-10-04 12:55:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:01,646 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2018-10-04 12:55:01,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:55:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2018-10-04 12:55:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-04 12:55:01,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:01,647 INFO L375 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1] [2018-10-04 12:55:01,647 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:01,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 43812988, now seen corresponding path program 40 times [2018-10-04 12:55:01,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:01,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:02,080 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:02,554 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:03,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:03,004 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-10-04 12:55:03,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:03,064 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:03,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:03,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:03,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:03,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 12:55:03,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:55:03,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:55:03,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:03,243 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand 44 states. [2018-10-04 12:55:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:03,406 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2018-10-04 12:55:03,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:55:03,407 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-10-04 12:55:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:03,408 INFO L225 Difference]: With dead ends: 275 [2018-10-04 12:55:03,408 INFO L226 Difference]: Without dead ends: 180 [2018-10-04 12:55:03,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 14 [2018-10-04 12:55:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-04 12:55:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-04 12:55:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-04 12:55:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2018-10-04 12:55:03,413 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 175 [2018-10-04 12:55:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:03,414 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2018-10-04 12:55:03,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:55:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2018-10-04 12:55:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-04 12:55:03,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:03,415 INFO L375 BasicCegarLoop]: trace histogram [87, 45, 42, 1, 1, 1] [2018-10-04 12:55:03,415 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:03,415 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 37875711, now seen corresponding path program 41 times [2018-10-04 12:55:03,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:03,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:03,745 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:04,084 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:04,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:04,384 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-10-04 12:55:04,391 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:04,514 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2018-10-04 12:55:04,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:04,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:04,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 12:55:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:55:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:55:04,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:04,694 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand 45 states. [2018-10-04 12:55:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:04,851 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2018-10-04 12:55:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:55:04,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-04 12:55:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:04,852 INFO L225 Difference]: With dead ends: 277 [2018-10-04 12:55:04,852 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 12:55:04,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 15 [2018-10-04 12:55:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 12:55:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-04 12:55:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 12:55:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-04 12:55:04,858 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 177 [2018-10-04 12:55:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:04,858 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-04 12:55:04,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:55:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-04 12:55:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-04 12:55:04,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:04,859 INFO L375 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1] [2018-10-04 12:55:04,859 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:04,860 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1372880190, now seen corresponding path program 42 times [2018-10-04 12:55:04,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:04,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:05,273 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:05,633 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 12:55:05,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:05,941 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-10-04 12:55:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:06,236 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 88 check-sat command(s) [2018-10-04 12:55:06,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:06,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:06,405 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:06,919 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:07,286 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3913 proven. 2025 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 12:55:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:07,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 48] total 92 [2018-10-04 12:55:07,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:55:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:55:07,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:07,430 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 92 states. [2018-10-04 12:55:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:08,609 INFO L93 Difference]: Finished difference Result 282 states and 376 transitions. [2018-10-04 12:55:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 12:55:08,609 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 179 [2018-10-04 12:55:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:08,610 INFO L225 Difference]: With dead ends: 282 [2018-10-04 12:55:08,610 INFO L226 Difference]: Without dead ends: 187 [2018-10-04 12:55:08,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime 13 [2018-10-04 12:55:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-04 12:55:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-04 12:55:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 12:55:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 232 transitions. [2018-10-04 12:55:08,614 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 232 transitions. Word has length 179 [2018-10-04 12:55:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:08,614 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 232 transitions. [2018-10-04 12:55:08,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:55:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2018-10-04 12:55:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-04 12:55:08,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:08,615 INFO L375 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1] [2018-10-04 12:55:08,616 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:08,616 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1960747786, now seen corresponding path program 43 times [2018-10-04 12:55:08,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:08,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:09,556 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:09,792 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 12:55:10,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:10,048 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-10-04 12:55:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:10,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 12:55:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 12:55:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:55:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:55:10,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:10,382 INFO L87 Difference]: Start difference. First operand 186 states and 232 transitions. Second operand 47 states. [2018-10-04 12:55:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:10,550 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2018-10-04 12:55:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:55:10,550 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 183 [2018-10-04 12:55:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:10,552 INFO L225 Difference]: With dead ends: 285 [2018-10-04 12:55:10,552 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 12:55:10,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 17 [2018-10-04 12:55:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 12:55:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 12:55:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 12:55:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2018-10-04 12:55:10,556 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 183 [2018-10-04 12:55:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:10,556 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2018-10-04 12:55:10,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:55:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2018-10-04 12:55:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-04 12:55:10,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:10,557 INFO L375 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1] [2018-10-04 12:55:10,558 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:10,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1731319693, now seen corresponding path program 44 times [2018-10-04 12:55:10,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:10,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:10,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:10,866 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:11,079 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 12:55:11,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:11,260 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-10-04 12:55:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:11,326 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:11,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:11,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 12:55:11,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:11,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 12:55:11,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:55:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:55:11,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:11,523 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 48 states. [2018-10-04 12:55:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:11,669 INFO L93 Difference]: Finished difference Result 287 states and 380 transitions. [2018-10-04 12:55:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:55:11,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 185 [2018-10-04 12:55:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:11,671 INFO L225 Difference]: With dead ends: 287 [2018-10-04 12:55:11,671 INFO L226 Difference]: Without dead ends: 190 [2018-10-04 12:55:11,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 18 [2018-10-04 12:55:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-04 12:55:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-10-04 12:55:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-04 12:55:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2018-10-04 12:55:11,675 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 185 [2018-10-04 12:55:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:11,675 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2018-10-04 12:55:11,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:55:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2018-10-04 12:55:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-04 12:55:11,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:11,676 INFO L375 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1] [2018-10-04 12:55:11,676 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:11,676 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash 294254416, now seen corresponding path program 45 times [2018-10-04 12:55:11,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:12,056 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:12,226 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4277 proven. 2162 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 12:55:12,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:12,476 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-10-04 12:55:12,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:12,615 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-10-04 12:55:12,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:12,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:13,123 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:13,464 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:13,709 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:13,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:13,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 94] total 94 [2018-10-04 12:55:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 12:55:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 12:55:13,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:13,849 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand 95 states. [2018-10-04 12:55:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:16,324 INFO L93 Difference]: Finished difference Result 295 states and 391 transitions. [2018-10-04 12:55:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 12:55:16,325 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2018-10-04 12:55:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:16,326 INFO L225 Difference]: With dead ends: 295 [2018-10-04 12:55:16,326 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:55:16,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.1s impTime 16 [2018-10-04 12:55:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:55:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-04 12:55:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-04 12:55:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2018-10-04 12:55:16,330 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 187 [2018-10-04 12:55:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:16,331 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2018-10-04 12:55:16,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 12:55:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-10-04 12:55:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-04 12:55:16,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:16,332 INFO L375 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1] [2018-10-04 12:55:16,332 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:16,332 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash -988584228, now seen corresponding path program 46 times [2018-10-04 12:55:16,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:16,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:16,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:16,661 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:17,049 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 2304 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 12:55:17,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:17,609 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-10-04 12:55:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:17,672 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:17,672 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:17,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:17,960 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:18,349 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:55:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:18,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:18,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 101 [2018-10-04 12:55:18,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 12:55:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 12:55:18,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:18,775 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand 101 states. [2018-10-04 12:55:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:20,054 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2018-10-04 12:55:20,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 12:55:20,054 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 195 [2018-10-04 12:55:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:20,055 INFO L225 Difference]: With dead ends: 209 [2018-10-04 12:55:20,055 INFO L226 Difference]: Without dead ends: 205 [2018-10-04 12:55:20,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime 20 [2018-10-04 12:55:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-04 12:55:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-10-04 12:55:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-04 12:55:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-10-04 12:55:20,062 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 195 [2018-10-04 12:55:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:20,063 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-10-04 12:55:20,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 12:55:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-10-04 12:55:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-04 12:55:20,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:20,065 INFO L375 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-10-04 12:55:20,065 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:20,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1862555477, now seen corresponding path program 47 times [2018-10-04 12:55:20,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:20,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:20,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:20,359 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:20,593 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:21,041 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 12:55:21,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:21,071 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-10-04 12:55:21,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:21,230 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2018-10-04 12:55:21,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:21,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 12:55:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 12:55:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:55:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:55:21,459 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:21,459 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 52 states. [2018-10-04 12:55:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:21,846 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-10-04 12:55:21,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:55:21,847 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 201 [2018-10-04 12:55:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:21,849 INFO L225 Difference]: With dead ends: 210 [2018-10-04 12:55:21,849 INFO L226 Difference]: Without dead ends: 206 [2018-10-04 12:55:21,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 7 [2018-10-04 12:55:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-04 12:55:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-10-04 12:55:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 12:55:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2018-10-04 12:55:21,855 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 201 [2018-10-04 12:55:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:21,856 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2018-10-04 12:55:21,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:55:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2018-10-04 12:55:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-04 12:55:21,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:21,857 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-10-04 12:55:21,857 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:21,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1085307248, now seen corresponding path program 48 times [2018-10-04 12:55:21,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:21,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:21,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:21,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:21,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:22,082 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:22,293 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:22,500 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 7450 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:55:22,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:55:22,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-10-04 12:55:22,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:55:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:55:22,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:22,560 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 53 states. [2018-10-04 12:55:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:22,989 INFO L93 Difference]: Finished difference Result 2756 states and 4081 transitions. [2018-10-04 12:55:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:55:22,990 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-10-04 12:55:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:23,001 INFO L225 Difference]: With dead ends: 2756 [2018-10-04 12:55:23,001 INFO L226 Difference]: Without dead ends: 2755 [2018-10-04 12:55:23,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 8 [2018-10-04 12:55:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-10-04 12:55:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 205. [2018-10-04 12:55:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-04 12:55:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2018-10-04 12:55:23,056 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 203 [2018-10-04 12:55:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:23,057 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2018-10-04 12:55:23,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:55:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-10-04 12:55:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-04 12:55:23,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:23,058 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1] [2018-10-04 12:55:23,059 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:23,059 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash -715213634, now seen corresponding path program 1 times [2018-10-04 12:55:23,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:23,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:23,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:23,557 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:23,912 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:24,484 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:55:24,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:24,567 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-10-04 12:55:24,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:24,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:55:25,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:25,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 12:55:25,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:55:25,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:55:25,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:25,856 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2018-10-04 12:55:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:27,109 INFO L93 Difference]: Finished difference Result 2859 states and 4234 transitions. [2018-10-04 12:55:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:55:27,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-10-04 12:55:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:27,123 INFO L225 Difference]: With dead ends: 2859 [2018-10-04 12:55:27,123 INFO L226 Difference]: Without dead ends: 2856 [2018-10-04 12:55:27,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 1.1s impTime 8 [2018-10-04 12:55:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-10-04 12:55:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 207. [2018-10-04 12:55:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:55:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2018-10-04 12:55:27,212 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 204 [2018-10-04 12:55:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2018-10-04 12:55:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:55:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2018-10-04 12:55:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 12:55:27,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:27,213 INFO L375 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1] [2018-10-04 12:55:27,214 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:27,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -133074471, now seen corresponding path program 2 times [2018-10-04 12:55:27,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:27,966 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:28,447 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:28,689 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:55:28,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:55:28,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-04 12:55:28,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:55:28,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:55:28,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:28,732 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 52 states. [2018-10-04 12:55:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:29,037 INFO L93 Difference]: Finished difference Result 306 states and 406 transitions. [2018-10-04 12:55:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:55:29,038 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 206 [2018-10-04 12:55:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:29,038 INFO L225 Difference]: With dead ends: 306 [2018-10-04 12:55:29,039 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:55:29,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 7 [2018-10-04 12:55:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:55:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:55:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:55:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:55:29,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-10-04 12:55:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:29,041 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:55:29,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:55:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:55:29,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:55:29,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:55:46,396 WARN L178 SmtUtils]: Spent 17.33 s on a formula simplification. DAG size of input: 3207 DAG size of output: 3056 [2018-10-04 12:56:50,649 WARN L178 SmtUtils]: Spent 1.07 m on a formula simplification. DAG size of input: 3056 DAG size of output: 407 [2018-10-04 12:56:50,655 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point mainENTRY(lines 11 26) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-04 12:56:50,656 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-10-04 12:56:50,660 INFO L421 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (or (and (<= 83 x) (and (<= y 83) (and (<= x 83) (<= 83 y)))) (and (and (and (<= x 71) (<= 71 y)) (<= y 71)) (<= 71 x)) (and (and (<= y 75) (and (<= x 75) (<= 75 y))) (<= 75 x)) (and (<= 68 x) (and (and (<= 68 y) (<= x 68)) (<= y 68))) (and (<= 82 x) (and (and (<= x 82) (<= 82 y)) (<= y 82))) (and (<= 92 x) (and (<= y 92) (and (<= 92 y) (<= x 92)))) (and (<= 88 x) (and (and (<= x 88) (<= 88 y)) (<= y 88))) (and (<= 57 x) (and (and (<= x 57) (<= 57 y)) (<= y 57))) (and (and (<= y 58) (and (<= 58 y) (<= x 58))) (<= 58 x)) (and (and (<= y 91) (and (<= 91 y) (<= x 91))) (<= 91 x)) (and (<= 74 x) (and (and (<= x 74) (<= 74 y)) (<= y 74))) (and (and (and (<= x 72) (<= 72 y)) (<= y 72)) (<= 72 x)) (and (<= 87 x) (and (<= y 87) (and (<= 87 y) (<= x 87)))) (and (and (and (<= 60 y) (<= x 60)) (<= y 60)) (<= 60 x)) (and (and (and (<= x 76) (<= 76 y)) (<= y 76)) (<= 76 x)) (and (<= 56 x) (and (and (<= x 56) (<= 56 y)) (<= y 56))) (and (<= 100 x) (and (<= 100 y) (<= y 100))) (and (<= 53 x) (and (and (<= 53 y) (<= x 53)) (<= y 53))) (and (<= 86 x) (and (<= y 86) (and (<= 86 y) (<= x 86)))) (and (and (<= y 79) (and (<= 79 y) (<= x 79))) (<= 79 x)) (and (and (and (<= 99 y) (<= x 99)) (<= y 99)) (<= 99 x)) (and (and (<= y 78) (and (<= 78 y) (<= x 78))) (<= 78 x)) (and (and (<= y 63) (and (<= 63 y) (<= x 63))) (<= 63 x)) (and (and (and (<= x 94) (<= 94 y)) (<= y 94)) (<= 94 x)) (and (and (<= y 55) (and (<= x 55) (<= 55 y))) (<= 55 x)) (and (<= 70 x) (and (and (<= 70 y) (<= x 70)) (<= y 70))) (and (<= 85 x) (and (<= y 85) (and (<= 85 y) (<= x 85)))) (and (<= 54 x) (and (and (<= x 54) (<= 54 y)) (<= y 54))) (and (and (and (<= x 89) (<= 89 y)) (<= y 89)) (<= 89 x)) (and (and (and (<= 69 y) (<= x 69)) (<= y 69)) (<= 69 x)) (and (<= 64 x) (and (<= y 64) (and (<= 64 y) (<= x 64)))) (and (and (and (<= x 59) (<= 59 y)) (<= y 59)) (<= 59 x)) (and (and (and (<= 97 y) (<= x 97)) (<= y 97)) (<= 97 x)) (and (<= 52 x) (and (and (<= 52 y) (<= x 52)) (<= y 52))) (and (<= 61 x) (and (<= y 61) (and (<= 61 y) (<= x 61)))) (and (<= 84 x) (and (and (<= x 84) (<= 84 y)) (<= y 84))) (and (<= 80 x) (and (<= y 80) (and (<= x 80) (<= 80 y)))) (and (<= 95 x) (and (<= y 95) (and (<= x 95) (<= 95 y)))) (and (and (<= y 65) (and (<= 65 y) (<= x 65))) (<= 65 x)) (and (and (<= y 77) (and (<= 77 y) (<= x 77))) (<= 77 x)) (and (and (<= y 90) (and (<= x 90) (<= 90 y))) (<= 90 x)) (and (<= 51 x) (and (and (<= x 51) (<= 51 y)) (<= y 51))) (and (<= 73 x) (and (<= y 73) (and (<= x 73) (<= 73 y)))) (and (and (and (<= x 93) (<= 93 y)) (<= y 93)) (<= 93 x)) (and (and (<= y 81) (and (<= x 81) (<= 81 y))) (<= 81 x)) (and (and (and (<= 67 y) (<= x 67)) (<= y 67)) (<= 67 x)) (and (<= 62 x) (and (<= y 62) (and (<= 62 y) (<= x 62)))) (and (<= 98 x) (and (<= y 98) (and (<= x 98) (<= 98 y)))) (and (<= y 50) (and (<= 50 y) (<= x 50))) (and (<= 96 x) (and (<= y 96) (and (<= 96 y) (<= x 96)))) (and (and (and (<= x 66) (<= 66 y)) (<= y 66)) (<= 66 x))) [2018-10-04 12:56:50,660 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-10-04 12:56:50,693 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:56:50 BoogieIcfgContainer [2018-10-04 12:56:50,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:56:50,694 INFO L168 Benchmark]: Toolchain (without parser) took 156136.90 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-04 12:56:50,695 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-10-04 12:56:50,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:56:50,696 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:56:50,696 INFO L168 Benchmark]: RCFGBuilder took 334.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:56:50,697 INFO L168 Benchmark]: TraceAbstraction took 155723.82 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-04 12:56:50,701 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 47.96 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.93 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 334.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155723.82 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((83 <= x && y <= 83 && x <= 83 && 83 <= y) || (((x <= 71 && 71 <= y) && y <= 71) && 71 <= x)) || ((y <= 75 && x <= 75 && 75 <= y) && 75 <= x)) || (68 <= x && (68 <= y && x <= 68) && y <= 68)) || (82 <= x && (x <= 82 && 82 <= y) && y <= 82)) || (92 <= x && y <= 92 && 92 <= y && x <= 92)) || (88 <= x && (x <= 88 && 88 <= y) && y <= 88)) || (57 <= x && (x <= 57 && 57 <= y) && y <= 57)) || ((y <= 58 && 58 <= y && x <= 58) && 58 <= x)) || ((y <= 91 && 91 <= y && x <= 91) && 91 <= x)) || (74 <= x && (x <= 74 && 74 <= y) && y <= 74)) || (((x <= 72 && 72 <= y) && y <= 72) && 72 <= x)) || (87 <= x && y <= 87 && 87 <= y && x <= 87)) || (((60 <= y && x <= 60) && y <= 60) && 60 <= x)) || (((x <= 76 && 76 <= y) && y <= 76) && 76 <= x)) || (56 <= x && (x <= 56 && 56 <= y) && y <= 56)) || (100 <= x && 100 <= y && y <= 100)) || (53 <= x && (53 <= y && x <= 53) && y <= 53)) || (86 <= x && y <= 86 && 86 <= y && x <= 86)) || ((y <= 79 && 79 <= y && x <= 79) && 79 <= x)) || (((99 <= y && x <= 99) && y <= 99) && 99 <= x)) || ((y <= 78 && 78 <= y && x <= 78) && 78 <= x)) || ((y <= 63 && 63 <= y && x <= 63) && 63 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || ((y <= 55 && x <= 55 && 55 <= y) && 55 <= x)) || (70 <= x && (70 <= y && x <= 70) && y <= 70)) || (85 <= x && y <= 85 && 85 <= y && x <= 85)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || (((69 <= y && x <= 69) && y <= 69) && 69 <= x)) || (64 <= x && y <= 64 && 64 <= y && x <= 64)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (52 <= x && (52 <= y && x <= 52) && y <= 52)) || (61 <= x && y <= 61 && 61 <= y && x <= 61)) || (84 <= x && (x <= 84 && 84 <= y) && y <= 84)) || (80 <= x && y <= 80 && x <= 80 && 80 <= y)) || (95 <= x && y <= 95 && x <= 95 && 95 <= y)) || ((y <= 65 && 65 <= y && x <= 65) && 65 <= x)) || ((y <= 77 && 77 <= y && x <= 77) && 77 <= x)) || ((y <= 90 && x <= 90 && 90 <= y) && 90 <= x)) || (51 <= x && (x <= 51 && 51 <= y) && y <= 51)) || (73 <= x && y <= 73 && x <= 73 && 73 <= y)) || (((x <= 93 && 93 <= y) && y <= 93) && 93 <= x)) || ((y <= 81 && x <= 81 && 81 <= y) && 81 <= x)) || (((67 <= y && x <= 67) && y <= 67) && 67 <= x)) || (62 <= x && y <= 62 && 62 <= y && x <= 62)) || (98 <= x && y <= 98 && x <= 98 && 98 <= y)) || (y <= 50 && 50 <= y && x <= 50)) || (96 <= x && y <= 96 && 96 <= y && x <= 96)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 155.6s OverallTime, 52 OverallIterations, 101 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 81.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 396 SDtfs, 856 SDslu, 2760 SDs, 0 SdLazy, 5293 SolverSat, 1362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6977 GetRequests, 5252 SyntacticMatches, 0 SemanticMatches, 1725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 52 MinimizatonAttempts, 5210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 758 HoareAnnotationTreeSize, 1 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 17.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 334056 FormulaSimplificationTreeSizeReductionInter, 64.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 50.4s InterpolantComputationTime, 11600 NumberOfCodeBlocks, 11528 NumberOfCodeBlocksAsserted, 1390 NumberOfCheckSat, 11499 ConstructedInterpolants, 0 QuantifiedInterpolants, 3507697 SizeOfPredicates, 13 NumberOfNonLiveVariables, 14067 ConjunctsInSsa, 1496 ConjunctsInUnsatCore, 101 InterpolantComputations, 4 PerfectInterpolantSequences, 305786/416427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-56-50-719.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-56-50-719.csv Received shutdown request...