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/Luxembourg-ArraysIntegefied.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:34:57,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:34:57,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:34:57,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:34:57,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:34:57,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:34:57,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:34:57,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:34:57,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:34:57,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:34:57,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:34:57,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:34:57,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:34:57,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:34:57,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:34:57,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:34:57,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:34:57,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:34:57,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:34:57,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:34:57,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:34:57,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:34:57,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:34:57,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:34:57,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:34:57,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:34:57,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:34:57,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:34:57,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:34:57,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:34:57,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:34:57,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:34:57,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:34:57,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:34:57,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:34:57,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:34:57,447 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 14:34:57,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:34:57,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:34:57,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:34:57,476 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:34:57,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:34:57,477 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:34:57,477 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:34:57,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:34:57,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:34:57,478 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:34:57,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:34:57,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:34:57,478 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:34:57,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:34:57,479 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:34:57,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:34:57,479 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:34:57,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:34:57,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:34:57,480 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:34:57,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:34:57,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:34:57,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:34:57,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:34:57,480 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:34:57,481 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:34:57,481 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:34:57,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:34:57,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:34:57,482 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:34:57,482 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:34:57,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:34:57,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:34:57,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:34:57,543 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:34:57,544 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:34:57,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl [2018-10-04 14:34:57,545 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl' [2018-10-04 14:34:57,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:34:57,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:34:57,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:34:57,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:34:57,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:34:57,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,637 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:34:57,637 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:34:57,637 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:34:57,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:34:57,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:34:57,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:34:57,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:34:57,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/1) ... [2018-10-04 14:34:57,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:34:57,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:34:57,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:34:57,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:34:57,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (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 14:34:57,729 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 14:34:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 14:34:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 14:34:58,094 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:34:58,095 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:34:58 BoogieIcfgContainer [2018-10-04 14:34:58,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:34:58,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:34:58,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:34:58,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:34:58,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:57" (1/2) ... [2018-10-04 14:34:58,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c944550 and model type Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:34:58, skipping insertion in model container [2018-10-04 14:34:58,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:34:58" (2/2) ... [2018-10-04 14:34:58,103 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-ArraysIntegefied.bpl [2018-10-04 14:34:58,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:34:58,121 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:34:58,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:34:58,177 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:34:58,178 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:34:58,178 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:34:58,178 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:34:58,178 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:34:58,178 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:34:58,179 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:34:58,180 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:34:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-10-04 14:34:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:34:58,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:58,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:34:58,203 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:58,210 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 890493448, now seen corresponding path program 1 times [2018-10-04 14:34:58,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,381 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 14:34:58,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:34:58,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:34:58,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:34:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:34:58,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:58,415 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-10-04 14:34:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:58,513 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-10-04 14:34:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:34:58,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 14:34:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:58,528 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:34:58,528 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:34:58,534 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 14:34:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:34:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:34:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:34:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:34:58,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-10-04 14:34:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:58,565 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:34:58,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:34:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:34:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:34:58,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:58,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:34:58,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:58,566 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 892342412, now seen corresponding path program 1 times [2018-10-04 14:34:58,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:58,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,591 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 14:34:58,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:34:58,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:34:58,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:34:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:34:58,594 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:58,595 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 3 states. [2018-10-04 14:34:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:58,605 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:34:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:34:58,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 14:34:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:58,607 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:34:58,607 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:34:58,608 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 14:34:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:34:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:34:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:34:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:34:58,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2018-10-04 14:34:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:34:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:34:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:34:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:34:58,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:58,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:34:58,613 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:58,614 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -391235530, now seen corresponding path program 1 times [2018-10-04 14:34:58,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,719 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 14:34:58,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:58,720 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 14:34:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:58,952 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 14:34:58,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:58,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:34:58,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:34:58,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:34:58,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:58,985 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2018-10-04 14:34:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:59,054 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:34:59,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:34:59,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 14:34:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:59,058 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:34:59,058 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:34:59,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 2 [2018-10-04 14:34:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:34:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:34:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:34:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:34:59,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-10-04 14:34:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:59,063 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:34:59,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:34:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:34:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:34:59,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:59,064 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:34:59,064 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:59,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -602113312, now seen corresponding path program 2 times [2018-10-04 14:34:59,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:59,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:59,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:59,191 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:59,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:59,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:59,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:59,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:34:59,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:34:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:34:59,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:59,378 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-04 14:34:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:59,401 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:34:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:34:59,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-04 14:34:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:59,402 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:34:59,403 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:34:59,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 3 [2018-10-04 14:34:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:34:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:34:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:34:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:34:59,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-10-04 14:34:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:59,409 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:34:59,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:34:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:34:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:34:59,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:59,410 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-04 14:34:59,411 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:59,411 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 334846090, now seen corresponding path program 3 times [2018-10-04 14:34:59,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:59,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:59,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 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 14:34:59,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:59,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:34:59,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:59,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:59,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:34:59,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:34:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:34:59,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:59,818 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-10-04 14:34:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:59,846 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:34:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:34:59,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 14:34:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:59,849 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:34:59,849 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:34:59,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:34:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:34:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:34:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:34:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:34:59,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-10-04 14:34:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:59,854 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:34:59,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:34:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:34:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:34:59,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:59,855 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-10-04 14:34:59,855 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:59,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash -747417292, now seen corresponding path program 4 times [2018-10-04 14:34:59,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:59,954 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 14:34:59,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:59,991 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:59,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:59,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:00,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:00,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:00,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:00,230 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:00,230 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-10-04 14:35:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:00,258 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:35:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:00,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 14:35:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:00,259 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:00,260 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:00,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 14:35:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:35:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:35:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:35:00,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-10-04 14:35:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:00,265 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:35:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:35:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:35:00,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:00,266 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:00,267 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:00,267 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1016128734, now seen corresponding path program 5 times [2018-10-04 14:35:00,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:00,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:00,412 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 14:35:00,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:00,436 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:00,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:00,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:00,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:00,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:00,667 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-10-04 14:35:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:00,855 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:35:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:00,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-04 14:35:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:00,858 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:00,858 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:00,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 14:35:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:35:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:35:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:35:00,866 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-10-04 14:35:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:00,866 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:35:00,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:35:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:35:00,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:00,868 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:00,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:00,868 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:00,869 INFO L82 PathProgramCache]: Analyzing trace with hash -267873400, now seen corresponding path program 6 times [2018-10-04 14:35:00,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:01,036 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 14:35:01,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:01,078 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:01,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:01,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:01,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:01,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:01,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:01,449 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:01,490 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:35:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:01,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-04 14:35:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:01,492 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:01,492 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:01,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 7 [2018-10-04 14:35:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:35:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:35:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:35:01,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-10-04 14:35:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:01,498 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:35:01,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:35:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:35:01,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:01,500 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:01,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:01,500 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1386947278, now seen corresponding path program 7 times [2018-10-04 14:35:01,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:01,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:01,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:01,682 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 14:35:01,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:01,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:01,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:35:01,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:35:01,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:35:01,879 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:01,880 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 10 states. [2018-10-04 14:35:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:01,910 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:35:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:35:01,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-04 14:35:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:01,913 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:01,913 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:01,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 14:35:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:35:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:35:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:35:01,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-10-04 14:35:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:01,918 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:35:01,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:35:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:35:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:35:01,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:01,920 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:01,920 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:01,920 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash -223329828, now seen corresponding path program 8 times [2018-10-04 14:35:01,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:01,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:02,085 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 14:35:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:02,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:02,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:02,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:02,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:35:02,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:35:02,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:35:02,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:02,250 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 11 states. [2018-10-04 14:35:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:02,283 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:35:02,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:35:02,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-04 14:35:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:02,284 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:35:02,284 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:35:02,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:35:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:35:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:35:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:35:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:35:02,292 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-10-04 14:35:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:02,292 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:35:02,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:35:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:35:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:35:02,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:02,294 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:02,294 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:02,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1659551354, now seen corresponding path program 9 times [2018-10-04 14:35:02,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:02,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:02,451 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 14:35:02,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:02,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 14:35:02,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:02,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:02,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:35:02,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:35:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:35:02,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:02,630 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 12 states. [2018-10-04 14:35:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:02,782 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 14:35:02,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:35:02,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-04 14:35:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:02,783 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:35:02,783 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:35:02,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 14:35:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:35:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:35:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:35:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 14:35:02,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-10-04 14:35:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:02,788 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 14:35:02,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:35:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 14:35:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:35:02,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:02,790 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:02,790 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:02,791 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2009179088, now seen corresponding path program 10 times [2018-10-04 14:35:02,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:02,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:02,986 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 14:35:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:03,008 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:03,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:03,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:03,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:03,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:35:03,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:35:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:35:03,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:03,146 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 13 states. [2018-10-04 14:35:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:03,205 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 14:35:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:35:03,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-04 14:35:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:03,210 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:35:03,210 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:35:03,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:35:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:35:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:35:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:35:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 14:35:03,215 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-10-04 14:35:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:03,216 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 14:35:03,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:35:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 14:35:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:35:03,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:03,217 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:03,217 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:03,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash 782635482, now seen corresponding path program 11 times [2018-10-04 14:35:03,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:03,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:03,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:03,389 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 14:35:03,397 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:03,419 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 14:35:03,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:03,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:03,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:35:03,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:35:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:35:03,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:03,693 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 14 states. [2018-10-04 14:35:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:03,718 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 14:35:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:35:03,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-04 14:35:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:03,720 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:35:03,720 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:35:03,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 12 [2018-10-04 14:35:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:35:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:35:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:35:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 14:35:03,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-10-04 14:35:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:03,727 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 14:35:03,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:35:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 14:35:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:35:03,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:03,728 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:03,728 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:03,729 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1233576580, now seen corresponding path program 12 times [2018-10-04 14:35:03,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:03,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:03,885 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 14:35:03,892 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:04,053 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:35:04,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:04,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:04,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:04,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:35:04,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:35:04,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:35:04,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:04,335 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 15 states. [2018-10-04 14:35:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:04,359 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 14:35:04,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:35:04,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-04 14:35:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:04,361 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:35:04,361 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:35:04,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 13 [2018-10-04 14:35:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:35:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:35:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:35:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 14:35:04,366 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-10-04 14:35:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:04,366 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 14:35:04,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:35:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 14:35:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:35:04,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:04,367 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:04,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:04,368 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1893420590, now seen corresponding path program 13 times [2018-10-04 14:35:04,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:05,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:05,346 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 14:35:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:05,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:05,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:05,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:35:05,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:35:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:35:05,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:05,596 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 16 states. [2018-10-04 14:35:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:05,637 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 14:35:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:35:05,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-04 14:35:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:05,638 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:35:05,638 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:35:05,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 14 [2018-10-04 14:35:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:35:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:35:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:35:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 14:35:05,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-10-04 14:35:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:05,645 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 14:35:05,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:35:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 14:35:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:35:05,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:05,646 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:05,646 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:05,646 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1151478568, now seen corresponding path program 14 times [2018-10-04 14:35:05,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:06,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:06,139 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 14:35:06,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:06,191 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:06,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:06,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:06,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:06,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:35:06,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:35:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:35:06,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:06,357 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 17 states. [2018-10-04 14:35:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:06,403 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 14:35:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:35:06,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-04 14:35:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:06,404 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:35:06,405 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:35:06,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 15 [2018-10-04 14:35:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:35:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:35:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:35:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 14:35:06,410 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-10-04 14:35:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:06,410 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 14:35:06,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:35:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 14:35:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:35:06,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:06,412 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:06,412 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:06,412 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1586034306, now seen corresponding path program 15 times [2018-10-04 14:35:06,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:06,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:06,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:06,732 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 14:35:06,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:06,770 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 14:35:06,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:07,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:07,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:35:07,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:35:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:35:07,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:07,076 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 18 states. [2018-10-04 14:35:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:07,136 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 14:35:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:35:07,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-04 14:35:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:07,138 INFO L225 Difference]: With dead ends: 73 [2018-10-04 14:35:07,138 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:35:07,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 16 [2018-10-04 14:35:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:35:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:35:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:35:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 14:35:07,144 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-10-04 14:35:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:07,144 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 14:35:07,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:35:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 14:35:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:35:07,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:07,146 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:07,146 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:07,146 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1318531884, now seen corresponding path program 16 times [2018-10-04 14:35:07,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:07,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:07,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:07,397 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 14:35:07,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:07,421 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:07,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:07,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:08,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:08,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:35:08,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:35:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:35:08,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:08,065 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 19 states. [2018-10-04 14:35:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:08,143 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 14:35:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:35:08,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-04 14:35:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:08,144 INFO L225 Difference]: With dead ends: 77 [2018-10-04 14:35:08,144 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:35:08,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime 17 [2018-10-04 14:35:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:35:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:35:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:35:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 14:35:08,150 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-10-04 14:35:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:08,150 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 14:35:08,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:35:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 14:35:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:35:08,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:08,152 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:08,152 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:08,152 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -561837354, now seen corresponding path program 17 times [2018-10-04 14:35:08,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:08,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:08,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:08,565 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 14:35:08,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:08,594 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 14:35:08,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:08,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:35:08,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:35:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:35:08,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:08,757 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 20 states. [2018-10-04 14:35:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:08,812 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 14:35:08,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:35:08,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-04 14:35:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:08,814 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:35:08,814 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:35:08,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 14:35:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:35:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:35:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:35:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 14:35:08,819 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-10-04 14:35:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:08,820 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 14:35:08,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:35:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 14:35:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:35:08,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:08,821 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:08,821 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:08,821 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1611070848, now seen corresponding path program 18 times [2018-10-04 14:35:08,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:09,131 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 14:35:09,138 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:09,160 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:35:09,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:09,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:35:09,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:35:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:35:09,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:09,307 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 21 states. [2018-10-04 14:35:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:09,347 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-04 14:35:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:35:09,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-04 14:35:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:09,349 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:35:09,349 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 14:35:09,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 19 [2018-10-04 14:35:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 14:35:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 14:35:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 14:35:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 14:35:09,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-10-04 14:35:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 14:35:09,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:35:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 14:35:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:35:09,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:09,355 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:09,355 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:09,356 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1013085398, now seen corresponding path program 19 times [2018-10-04 14:35:09,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:09,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:09,650 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 14:35:09,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:09,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:35:09,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:35:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:35:09,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:09,982 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 22 states. [2018-10-04 14:35:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:10,045 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-04 14:35:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:35:10,045 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-04 14:35:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:10,046 INFO L225 Difference]: With dead ends: 89 [2018-10-04 14:35:10,046 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:35:10,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 20 [2018-10-04 14:35:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:35:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 14:35:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 14:35:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 14:35:10,051 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-10-04 14:35:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:10,051 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 14:35:10,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:35:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 14:35:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 14:35:10,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:10,052 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:10,053 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:10,053 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 947991508, now seen corresponding path program 20 times [2018-10-04 14:35:10,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:10,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:10,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:10,328 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 14:35:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:10,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:10,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:10,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:10,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:10,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:35:10,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:35:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:35:10,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:10,651 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 23 states. [2018-10-04 14:35:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:10,682 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-04 14:35:10,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:35:10,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-04 14:35:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:10,687 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:35:10,687 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:35:10,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 21 [2018-10-04 14:35:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:35:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:35:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:35:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-04 14:35:10,690 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-10-04 14:35:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:10,690 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-04 14:35:10,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:35:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-04 14:35:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 14:35:10,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:10,692 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:10,692 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:10,692 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -861112450, now seen corresponding path program 21 times [2018-10-04 14:35:10,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:11,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:11,236 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 14:35:11,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:11,310 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 14:35:11,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:11,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:11,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:11,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:35:11,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:35:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:35:11,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:11,639 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 24 states. [2018-10-04 14:35:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:11,698 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-04 14:35:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:35:11,698 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-04 14:35:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:11,699 INFO L225 Difference]: With dead ends: 97 [2018-10-04 14:35:11,699 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 14:35:11,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 22 [2018-10-04 14:35:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 14:35:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 14:35:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 14:35:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-04 14:35:11,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-10-04 14:35:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:11,703 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-04 14:35:11,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:35:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-04 14:35:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 14:35:11,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:11,704 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:11,704 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:11,704 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 215602728, now seen corresponding path program 22 times [2018-10-04 14:35:11,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:11,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:12,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:12,010 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 14:35:12,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:12,037 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:12,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:12,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:35:12,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:35:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:35:12,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:12,234 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 25 states. [2018-10-04 14:35:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:12,270 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 14:35:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:35:12,271 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-04 14:35:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:12,272 INFO L225 Difference]: With dead ends: 101 [2018-10-04 14:35:12,272 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:35:12,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 23 [2018-10-04 14:35:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:35:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 14:35:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 14:35:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-04 14:35:12,276 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-10-04 14:35:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:12,276 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-04 14:35:12,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:35:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-04 14:35:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 14:35:12,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:12,277 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:12,278 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:12,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1534865454, now seen corresponding path program 23 times [2018-10-04 14:35:12,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:12,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:12,648 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 14:35:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:12,689 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 14:35:12,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:12,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:35:13,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:35:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:35:13,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:13,052 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 26 states. [2018-10-04 14:35:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:13,099 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-04 14:35:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:35:13,101 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-10-04 14:35:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:13,102 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:35:13,102 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 14:35:13,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 24 [2018-10-04 14:35:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 14:35:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 14:35:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 14:35:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-04 14:35:13,105 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-10-04 14:35:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:13,105 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-04 14:35:13,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:35:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-04 14:35:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 14:35:13,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:13,106 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:13,106 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:13,106 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:13,106 INFO L82 PathProgramCache]: Analyzing trace with hash -35330948, now seen corresponding path program 24 times [2018-10-04 14:35:13,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:13,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:13,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:13,449 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 14:35:13,457 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:13,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:35:13,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:13,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:13,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:13,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:35:13,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:35:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:35:13,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:13,682 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 27 states. [2018-10-04 14:35:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:13,714 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-04 14:35:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:35:13,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-10-04 14:35:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:13,716 INFO L225 Difference]: With dead ends: 109 [2018-10-04 14:35:13,716 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 14:35:13,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 25 [2018-10-04 14:35:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 14:35:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-04 14:35:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 14:35:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-04 14:35:13,720 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-10-04 14:35:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:13,720 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-04 14:35:13,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:35:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-04 14:35:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 14:35:13,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:13,721 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:13,721 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:13,722 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -503868378, now seen corresponding path program 25 times [2018-10-04 14:35:13,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:14,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:14,138 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 14:35:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:14,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:14,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:14,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:35:14,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:35:14,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:35:14,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:14,423 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 28 states. [2018-10-04 14:35:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:14,468 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-04 14:35:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:35:14,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-10-04 14:35:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:14,469 INFO L225 Difference]: With dead ends: 113 [2018-10-04 14:35:14,470 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:35:14,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 26 [2018-10-04 14:35:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:35:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-04 14:35:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 14:35:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-04 14:35:14,473 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-10-04 14:35:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-04 14:35:14,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:35:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-04 14:35:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-04 14:35:14,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:14,474 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:14,475 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:14,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 410410704, now seen corresponding path program 26 times [2018-10-04 14:35:14,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:15,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:15,548 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 14:35:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:15,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:15,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:15,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:15,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:15,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:35:15,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:35:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:35:15,779 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:15,779 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 29 states. [2018-10-04 14:35:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:15,884 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-04 14:35:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:35:15,884 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-10-04 14:35:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:15,886 INFO L225 Difference]: With dead ends: 117 [2018-10-04 14:35:15,886 INFO L226 Difference]: Without dead ends: 115 [2018-10-04 14:35:15,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 27 [2018-10-04 14:35:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-04 14:35:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-04 14:35:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 14:35:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-04 14:35:15,889 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-10-04 14:35:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:15,890 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-04 14:35:15,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:35:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-04 14:35:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-04 14:35:15,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:15,891 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:15,891 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:15,891 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash 131843194, now seen corresponding path program 27 times [2018-10-04 14:35:15,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:15,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:16,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:16,223 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 14:35:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:16,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 14:35:16,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:16,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:16,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:16,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:35:16,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:35:16,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:35:16,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:16,549 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 30 states. [2018-10-04 14:35:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:16,594 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-04 14:35:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:35:16,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-10-04 14:35:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:16,596 INFO L225 Difference]: With dead ends: 121 [2018-10-04 14:35:16,596 INFO L226 Difference]: Without dead ends: 119 [2018-10-04 14:35:16,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 28 [2018-10-04 14:35:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-04 14:35:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-04 14:35:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 14:35:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-04 14:35:16,601 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-10-04 14:35:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-04 14:35:16,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:35:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-04 14:35:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 14:35:16,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:16,602 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:16,603 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:16,603 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1432503588, now seen corresponding path program 28 times [2018-10-04 14:35:16,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:17,196 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 14:35:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:17,229 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:17,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:17,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:17,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:35:17,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:35:17,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:35:17,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:17,433 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 31 states. [2018-10-04 14:35:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,520 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-04 14:35:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:35:17,521 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-04 14:35:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,522 INFO L225 Difference]: With dead ends: 125 [2018-10-04 14:35:17,522 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:35:17,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 29 [2018-10-04 14:35:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:35:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-04 14:35:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 14:35:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-04 14:35:17,526 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-10-04 14:35:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,526 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-04 14:35:17,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:35:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-04 14:35:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 14:35:17,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,527 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:17,528 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,528 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2063310642, now seen corresponding path program 29 times [2018-10-04 14:35:17,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:17,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,010 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 14:35:18,017 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:18,055 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 14:35:18,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:35:18,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:35:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:35:18,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,263 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 32 states. [2018-10-04 14:35:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:18,312 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-04 14:35:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:35:18,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-10-04 14:35:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:18,314 INFO L225 Difference]: With dead ends: 129 [2018-10-04 14:35:18,314 INFO L226 Difference]: Without dead ends: 127 [2018-10-04 14:35:18,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 30 [2018-10-04 14:35:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-04 14:35:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-04 14:35:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 14:35:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-04 14:35:18,318 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-10-04 14:35:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:18,318 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-04 14:35:18,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:35:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-04 14:35:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-04 14:35:18,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:18,319 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:18,319 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:18,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1719888008, now seen corresponding path program 30 times [2018-10-04 14:35:18,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:18,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,727 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 14:35:18,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:18,785 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:35:18,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:19,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:35:19,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:35:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:35:19,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:19,015 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 33 states. [2018-10-04 14:35:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:19,058 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-04 14:35:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:35:19,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-10-04 14:35:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:19,060 INFO L225 Difference]: With dead ends: 133 [2018-10-04 14:35:19,060 INFO L226 Difference]: Without dead ends: 131 [2018-10-04 14:35:19,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 31 [2018-10-04 14:35:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-04 14:35:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-04 14:35:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 14:35:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-04 14:35:19,064 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-10-04 14:35:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:19,065 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-04 14:35:19,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:35:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-04 14:35:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-04 14:35:19,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:19,066 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:19,066 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:19,066 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1270519518, now seen corresponding path program 31 times [2018-10-04 14:35:19,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:19,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:19,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:19,879 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 14:35:19,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:20,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:35:20,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:35:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:35:20,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:20,341 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 34 states. [2018-10-04 14:35:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:20,394 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-04 14:35:20,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:35:20,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-10-04 14:35:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:20,396 INFO L225 Difference]: With dead ends: 137 [2018-10-04 14:35:20,396 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:35:20,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime 32 [2018-10-04 14:35:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:35:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 14:35:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 14:35:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-04 14:35:20,400 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-10-04 14:35:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:20,400 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-04 14:35:20,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:35:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-04 14:35:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-04 14:35:20,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:20,401 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:20,402 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:20,402 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1248242228, now seen corresponding path program 32 times [2018-10-04 14:35:20,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,121 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 14:35:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:21,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:21,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:35:21,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:35:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:35:21,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:21,415 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 35 states. [2018-10-04 14:35:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,483 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-04 14:35:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:35:21,484 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-04 14:35:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,485 INFO L225 Difference]: With dead ends: 141 [2018-10-04 14:35:21,485 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 14:35:21,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 33 [2018-10-04 14:35:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 14:35:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-04 14:35:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 14:35:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-04 14:35:21,489 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-10-04 14:35:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,489 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-04 14:35:21,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:35:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-04 14:35:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-04 14:35:21,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,490 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:21,490 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash -596451978, now seen corresponding path program 33 times [2018-10-04 14:35:21,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:21,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:21,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 14:35:21,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:22,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:35:22,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:35:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:35:22,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:22,262 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 36 states. [2018-10-04 14:35:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:22,312 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-04 14:35:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:35:22,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-10-04 14:35:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:22,314 INFO L225 Difference]: With dead ends: 145 [2018-10-04 14:35:22,314 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 14:35:22,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 34 [2018-10-04 14:35:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 14:35:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-04 14:35:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-04 14:35:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-04 14:35:22,318 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-10-04 14:35:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:22,319 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-04 14:35:22,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:35:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-04 14:35:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-04 14:35:22,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:22,320 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:22,320 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:22,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1720483872, now seen corresponding path program 34 times [2018-10-04 14:35:22,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:22,893 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 14:35:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:22,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:22,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:22,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:23,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:35:23,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:35:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:35:23,264 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:23,264 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 37 states. [2018-10-04 14:35:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:23,341 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-04 14:35:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:35:23,342 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-04 14:35:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:23,343 INFO L225 Difference]: With dead ends: 149 [2018-10-04 14:35:23,343 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 14:35:23,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 35 [2018-10-04 14:35:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 14:35:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-04 14:35:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 14:35:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-04 14:35:23,348 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-10-04 14:35:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:23,348 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-04 14:35:23,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:35:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-04 14:35:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-04 14:35:23,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:23,349 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:23,349 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:23,349 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash 811646410, now seen corresponding path program 35 times [2018-10-04 14:35:23,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:23,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:23,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,997 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 14:35:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:24,069 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 14:35:24,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:24,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:35:24,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:35:24,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:35:24,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,435 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 38 states. [2018-10-04 14:35:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,737 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-04 14:35:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:35:24,738 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-10-04 14:35:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,739 INFO L225 Difference]: With dead ends: 153 [2018-10-04 14:35:24,739 INFO L226 Difference]: Without dead ends: 151 [2018-10-04 14:35:24,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 36 [2018-10-04 14:35:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-04 14:35:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-04 14:35:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-04 14:35:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-04 14:35:24,743 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-10-04 14:35:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,744 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-04 14:35:24,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:35:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-04 14:35:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-04 14:35:24,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,745 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:24,745 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,745 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1428821620, now seen corresponding path program 36 times [2018-10-04 14:35:24,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:26,587 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 14:35:26,596 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:26,637 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:35:26,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:26,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:35:27,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:35:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:35:27,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:27,962 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 39 states. [2018-10-04 14:35:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:28,015 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-04 14:35:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:35:28,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-10-04 14:35:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:28,016 INFO L225 Difference]: With dead ends: 157 [2018-10-04 14:35:28,016 INFO L226 Difference]: Without dead ends: 155 [2018-10-04 14:35:28,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 1.3s impTime 37 [2018-10-04 14:35:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-04 14:35:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-04 14:35:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-04 14:35:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-04 14:35:28,020 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-10-04 14:35:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:28,020 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-04 14:35:28,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:35:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-04 14:35:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-04 14:35:28,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:28,021 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:28,021 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:28,021 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -823981538, now seen corresponding path program 37 times [2018-10-04 14:35:28,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,111 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 14:35:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:35:29,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:35:29,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:35:29,410 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,410 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 40 states. [2018-10-04 14:35:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,482 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-04 14:35:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:35:29,488 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-10-04 14:35:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,489 INFO L225 Difference]: With dead ends: 161 [2018-10-04 14:35:29,489 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:35:29,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 38 [2018-10-04 14:35:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:35:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-04 14:35:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-04 14:35:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-04 14:35:29,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-10-04 14:35:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,493 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-04 14:35:29,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:35:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-04 14:35:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-04 14:35:29,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,494 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:29,494 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,494 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash 373692616, now seen corresponding path program 38 times [2018-10-04 14:35:29,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,798 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 14:35:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:30,841 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:30,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:35:32,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:35:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:35:32,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,364 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 41 states. [2018-10-04 14:35:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,805 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-04 14:35:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:35:32,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-04 14:35:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,806 INFO L225 Difference]: With dead ends: 165 [2018-10-04 14:35:32,807 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 14:35:32,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.0s impTime 39 [2018-10-04 14:35:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 14:35:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-04 14:35:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-04 14:35:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-04 14:35:32,811 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-10-04 14:35:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,811 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-04 14:35:32,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:35:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-04 14:35:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-04 14:35:32,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,813 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:32,813 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,813 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1026702734, now seen corresponding path program 39 times [2018-10-04 14:35:32,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,947 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 14:35:33,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:34,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 14:35:34,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:34,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:34,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:35:34,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:35:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:35:34,299 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,299 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 42 states. [2018-10-04 14:35:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,475 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-04 14:35:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:35:34,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-04 14:35:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,477 INFO L225 Difference]: With dead ends: 169 [2018-10-04 14:35:34,477 INFO L226 Difference]: Without dead ends: 167 [2018-10-04 14:35:34,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 40 [2018-10-04 14:35:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-04 14:35:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-04 14:35:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 14:35:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-04 14:35:34,481 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-10-04 14:35:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:34,482 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-04 14:35:34,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:35:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-04 14:35:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-04 14:35:34,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:34,483 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:34,483 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:34,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 716474140, now seen corresponding path program 40 times [2018-10-04 14:35:34,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:35,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:35,993 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 14:35:36,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:36,042 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:36,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:36,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:36,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:36,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:35:36,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:35:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:35:36,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:36,321 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 43 states. [2018-10-04 14:35:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:36,388 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-04 14:35:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:35:36,389 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-04 14:35:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:36,390 INFO L225 Difference]: With dead ends: 173 [2018-10-04 14:35:36,390 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 14:35:36,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 41 [2018-10-04 14:35:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 14:35:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-04 14:35:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-04 14:35:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-04 14:35:36,392 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-10-04 14:35:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:36,392 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-04 14:35:36,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:35:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-04 14:35:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-04 14:35:36,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:36,394 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:36,394 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:36,394 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 49604294, now seen corresponding path program 41 times [2018-10-04 14:35:36,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:36,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:37,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:37,252 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 14:35:37,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:37,320 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 14:35:37,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:37,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:37,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:37,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:35:37,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:35:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:35:37,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:37,627 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 44 states. [2018-10-04 14:35:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,759 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-04 14:35:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:35:37,760 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-10-04 14:35:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,761 INFO L225 Difference]: With dead ends: 177 [2018-10-04 14:35:37,761 INFO L226 Difference]: Without dead ends: 175 [2018-10-04 14:35:37,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 42 [2018-10-04 14:35:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-04 14:35:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-04 14:35:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 14:35:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-04 14:35:37,765 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-10-04 14:35:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:37,765 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-04 14:35:37,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:35:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-04 14:35:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-04 14:35:37,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:37,767 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:37,767 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:37,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -11968144, now seen corresponding path program 42 times [2018-10-04 14:35:37,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:37,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:38,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:38,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 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 14:35:38,487 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:38,540 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 14:35:38,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:38,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:38,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:35:38,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:35:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:35:38,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:38,869 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 45 states. [2018-10-04 14:35:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:39,000 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-04 14:35:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:35:39,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-10-04 14:35:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:39,008 INFO L225 Difference]: With dead ends: 181 [2018-10-04 14:35:39,008 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 14:35:39,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 43 [2018-10-04 14:35:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 14:35:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-04 14:35:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-04 14:35:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-04 14:35:39,012 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-10-04 14:35:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-04 14:35:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:35:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-04 14:35:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-04 14:35:39,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:39,013 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:39,013 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:39,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1915516698, now seen corresponding path program 43 times [2018-10-04 14:35:39,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:40,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:40,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 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 14:35:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:40,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:40,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:35:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:35:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:35:40,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:40,377 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 46 states. [2018-10-04 14:35:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:40,449 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-04 14:35:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:35:40,449 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-10-04 14:35:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:40,451 INFO L225 Difference]: With dead ends: 185 [2018-10-04 14:35:40,451 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 14:35:40,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 44 [2018-10-04 14:35:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 14:35:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-04 14:35:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 14:35:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-04 14:35:40,455 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-10-04 14:35:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:40,455 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-04 14:35:40,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:35:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-04 14:35:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 14:35:40,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:40,457 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:40,457 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:40,457 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash -321345596, now seen corresponding path program 44 times [2018-10-04 14:35:40,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:40,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:41,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:41,801 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 14:35:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:41,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:41,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:41,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:42,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:35:42,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:35:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:35:42,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:42,146 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 47 states. [2018-10-04 14:35:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:42,237 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-04 14:35:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:35:42,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-10-04 14:35:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:42,239 INFO L225 Difference]: With dead ends: 189 [2018-10-04 14:35:42,239 INFO L226 Difference]: Without dead ends: 187 [2018-10-04 14:35:42,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 45 [2018-10-04 14:35:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-04 14:35:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-04 14:35:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 14:35:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-04 14:35:42,243 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-10-04 14:35:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:42,243 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-04 14:35:42,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:35:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-04 14:35:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-04 14:35:42,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:42,245 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:42,245 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:42,245 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash -548899986, now seen corresponding path program 45 times [2018-10-04 14:35:42,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:43,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,313 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 14:35:43,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:43,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 14:35:43,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:43,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:44,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:44,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:35:44,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:35:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:35:44,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:44,202 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 48 states. [2018-10-04 14:35:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:44,626 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-04 14:35:44,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:35:44,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-10-04 14:35:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:44,628 INFO L225 Difference]: With dead ends: 193 [2018-10-04 14:35:44,628 INFO L226 Difference]: Without dead ends: 191 [2018-10-04 14:35:44,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.7s impTime 46 [2018-10-04 14:35:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-04 14:35:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-04 14:35:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-04 14:35:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-04 14:35:44,633 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-10-04 14:35:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:44,633 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-04 14:35:44,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:35:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-04 14:35:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-04 14:35:44,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:44,634 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:44,635 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:44,635 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash 943086104, now seen corresponding path program 46 times [2018-10-04 14:35:44,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:44,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:45,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:45,761 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 14:35:45,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:45,808 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:45,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:45,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:46,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:35:46,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:35:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:35:46,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:46,306 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 49 states. [2018-10-04 14:35:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:46,387 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-04 14:35:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:35:46,387 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-04 14:35:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:46,388 INFO L225 Difference]: With dead ends: 197 [2018-10-04 14:35:46,389 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 14:35:46,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 47 [2018-10-04 14:35:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 14:35:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-04 14:35:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-04 14:35:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-04 14:35:46,393 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-10-04 14:35:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:46,393 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-04 14:35:46,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:35:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-04 14:35:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-04 14:35:46,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:46,394 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:46,395 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:46,395 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 85777346, now seen corresponding path program 47 times [2018-10-04 14:35:46,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:46,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:46,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:46,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:47,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:47,362 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 14:35:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:47,429 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 14:35:47,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:47,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:47,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:35:47,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:35:47,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:35:47,812 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:47,812 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 50 states. [2018-10-04 14:35:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:47,922 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-04 14:35:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:35:47,922 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-10-04 14:35:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:47,923 INFO L225 Difference]: With dead ends: 201 [2018-10-04 14:35:47,923 INFO L226 Difference]: Without dead ends: 199 [2018-10-04 14:35:47,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 48 [2018-10-04 14:35:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-04 14:35:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-04 14:35:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-04 14:35:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-04 14:35:47,928 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-10-04 14:35:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-04 14:35:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:35:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-04 14:35:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-04 14:35:47,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:47,929 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:47,929 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:47,929 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 305559660, now seen corresponding path program 48 times [2018-10-04 14:35:47,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:49,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:49,031 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 14:35:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:49,097 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 14:35:49,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:49,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:35:49,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:35:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:35:49,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:49,427 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 51 states. [2018-10-04 14:35:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:49,522 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-04 14:35:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:35:49,522 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-04 14:35:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:49,524 INFO L225 Difference]: With dead ends: 205 [2018-10-04 14:35:49,524 INFO L226 Difference]: Without dead ends: 203 [2018-10-04 14:35:49,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 49 [2018-10-04 14:35:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-04 14:35:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-04 14:35:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 14:35:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-04 14:35:49,528 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-10-04 14:35:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:49,528 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-04 14:35:49,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:35:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-04 14:35:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-04 14:35:49,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:49,529 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:49,529 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:49,529 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1971474410, now seen corresponding path program 49 times [2018-10-04 14:35:49,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:51,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:51,184 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 14:35:51,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:51,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:51,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:35:51,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:35:51,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:35:51,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:51,564 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 52 states. [2018-10-04 14:35:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:51,692 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-04 14:35:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:35:51,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-10-04 14:35:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:51,694 INFO L225 Difference]: With dead ends: 209 [2018-10-04 14:35:51,695 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 14:35:51,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.4s impTime 50 [2018-10-04 14:35:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 14:35:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-04 14:35:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 14:35:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-04 14:35:51,699 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 202 [2018-10-04 14:35:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:51,699 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-04 14:35:51,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:35:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-04 14:35:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 14:35:51,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:51,701 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:51,701 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:51,701 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1750269248, now seen corresponding path program 50 times [2018-10-04 14:35:51,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:51,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:52,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:52,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:52,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:52,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:52,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:52,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:53,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:53,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:35:53,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:35:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:35:53,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:53,296 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 53 states. [2018-10-04 14:35:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:53,418 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-04 14:35:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:35:53,419 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-10-04 14:35:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:53,420 INFO L225 Difference]: With dead ends: 213 [2018-10-04 14:35:53,421 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 14:35:53,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.6s impTime 51 [2018-10-04 14:35:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 14:35:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-04 14:35:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-04 14:35:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-04 14:35:53,424 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 206 [2018-10-04 14:35:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:53,425 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-04 14:35:53,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:35:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-04 14:35:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-04 14:35:53,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:53,426 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:53,426 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:53,426 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash 37679210, now seen corresponding path program 51 times [2018-10-04 14:35:53,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:54,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:54,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:54,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:54,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 14:35:54,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:54,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:55,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:55,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:35:55,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:35:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:35:55,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:55,144 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 54 states. [2018-10-04 14:35:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:55,263 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-04 14:35:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:35:55,263 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-10-04 14:35:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:55,265 INFO L225 Difference]: With dead ends: 217 [2018-10-04 14:35:55,265 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 14:35:55,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.7s impTime 52 [2018-10-04 14:35:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 14:35:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-04 14:35:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 14:35:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-04 14:35:55,268 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 210 [2018-10-04 14:35:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:55,269 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-04 14:35:55,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:35:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-04 14:35:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-04 14:35:55,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:55,270 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:55,271 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:55,271 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash -781321964, now seen corresponding path program 52 times [2018-10-04 14:35:55,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:56,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:56,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:56,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:56,863 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:56,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:56,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:35:57,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:35:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:35:57,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:57,310 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 55 states. [2018-10-04 14:35:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:57,454 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-04 14:35:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:35:57,454 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-10-04 14:35:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:57,456 INFO L225 Difference]: With dead ends: 221 [2018-10-04 14:35:57,456 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 14:35:57,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 53 [2018-10-04 14:35:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 14:35:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-04 14:35:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-04 14:35:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-04 14:35:57,459 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 214 [2018-10-04 14:35:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-04 14:35:57,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:35:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-04 14:35:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-04 14:35:57,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:57,460 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:57,461 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:57,461 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -348873538, now seen corresponding path program 53 times [2018-10-04 14:35:57,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:57,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:58,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:58,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:58,926 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 14:35:58,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:58,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:59,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:35:59,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:35:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:35:59,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:59,321 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 56 states. [2018-10-04 14:35:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:59,463 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-04 14:35:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:35:59,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-10-04 14:35:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:59,465 INFO L225 Difference]: With dead ends: 225 [2018-10-04 14:35:59,465 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 14:35:59,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 54 [2018-10-04 14:35:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 14:35:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-04 14:35:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-04 14:35:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-04 14:35:59,468 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 218 [2018-10-04 14:35:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:59,468 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-04 14:35:59,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:35:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-04 14:35:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-04 14:35:59,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:59,469 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-10-04 14:35:59,469 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:59,469 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1269998744, now seen corresponding path program 54 times [2018-10-04 14:35:59,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:59,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:00,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:00,766 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 14:36:00,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:00,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:01,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:36:01,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:36:01,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:36:01,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:01,339 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 57 states. [2018-10-04 14:36:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:01,488 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-04 14:36:01,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:36:01,489 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-10-04 14:36:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:01,490 INFO L225 Difference]: With dead ends: 229 [2018-10-04 14:36:01,490 INFO L226 Difference]: Without dead ends: 227 [2018-10-04 14:36:01,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.9s impTime 55 [2018-10-04 14:36:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-04 14:36:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-04 14:36:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 14:36:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-04 14:36:01,494 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 222 [2018-10-04 14:36:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:01,495 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-04 14:36:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:36:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-04 14:36:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-04 14:36:01,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:01,496 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:01,496 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:01,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1338854126, now seen corresponding path program 55 times [2018-10-04 14:36:01,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:03,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:03,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:03,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:36:03,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:36:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:36:03,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:03,468 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 58 states. [2018-10-04 14:36:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,630 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-04 14:36:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:36:03,631 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-10-04 14:36:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,632 INFO L225 Difference]: With dead ends: 233 [2018-10-04 14:36:03,632 INFO L226 Difference]: Without dead ends: 231 [2018-10-04 14:36:03,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 56 [2018-10-04 14:36:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-04 14:36:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-04 14:36:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-04 14:36:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-04 14:36:03,636 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 226 [2018-10-04 14:36:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-04 14:36:03,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:36:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-04 14:36:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-04 14:36:03,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:03,638 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:03,638 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:03,638 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash 555690428, now seen corresponding path program 56 times [2018-10-04 14:36:03,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:05,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:05,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:05,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:05,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:05,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:36:05,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:36:05,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:36:05,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:05,770 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 59 states. [2018-10-04 14:36:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:05,948 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-04 14:36:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:36:05,948 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-04 14:36:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:05,950 INFO L225 Difference]: With dead ends: 237 [2018-10-04 14:36:05,950 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 14:36:05,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 57 [2018-10-04 14:36:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 14:36:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 14:36:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 14:36:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-04 14:36:05,953 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 230 [2018-10-04 14:36:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:05,953 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-04 14:36:05,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:36:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-04 14:36:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-04 14:36:05,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:05,954 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:05,954 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:05,954 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1475528346, now seen corresponding path program 57 times [2018-10-04 14:36:05,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:05,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:07,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:07,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 14:36:07,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:07,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:36:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:36:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:36:07,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:07,653 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 60 states. [2018-10-04 14:36:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:07,776 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-04 14:36:07,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:36:07,777 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-10-04 14:36:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:07,778 INFO L225 Difference]: With dead ends: 241 [2018-10-04 14:36:07,778 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 14:36:07,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 58 [2018-10-04 14:36:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 14:36:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 14:36:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 14:36:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-04 14:36:07,781 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 234 [2018-10-04 14:36:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:07,781 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-04 14:36:07,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:36:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-04 14:36:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-04 14:36:07,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:07,782 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:07,782 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:07,783 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash -457743344, now seen corresponding path program 58 times [2018-10-04 14:36:07,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:07,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:08,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:08,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:08,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:08,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:08,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:36:09,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:36:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:36:09,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:09,210 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 61 states. [2018-10-04 14:36:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:09,332 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-04 14:36:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:36:09,332 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-10-04 14:36:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:09,333 INFO L225 Difference]: With dead ends: 245 [2018-10-04 14:36:09,333 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 14:36:09,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 59 [2018-10-04 14:36:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 14:36:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-04 14:36:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 14:36:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-04 14:36:09,336 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 238 [2018-10-04 14:36:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:09,336 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-04 14:36:09,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:36:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-04 14:36:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-04 14:36:09,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:09,338 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:09,338 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:09,338 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash 362293690, now seen corresponding path program 59 times [2018-10-04 14:36:09,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:10,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:10,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:10,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:10,719 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 14:36:10,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:10,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:11,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:36:11,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:36:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:36:11,171 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:11,171 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 62 states. [2018-10-04 14:36:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:11,386 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-04 14:36:11,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:36:11,387 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-10-04 14:36:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:11,388 INFO L225 Difference]: With dead ends: 249 [2018-10-04 14:36:11,388 INFO L226 Difference]: Without dead ends: 247 [2018-10-04 14:36:11,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 60 [2018-10-04 14:36:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-04 14:36:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-04 14:36:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 14:36:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-04 14:36:11,391 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 242 [2018-10-04 14:36:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:11,391 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-04 14:36:11,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:36:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-04 14:36:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-04 14:36:11,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:11,393 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:11,393 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:11,393 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1209398684, now seen corresponding path program 60 times [2018-10-04 14:36:11,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:11,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:12,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:12,784 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:12,861 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 14:36:12,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:12,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:13,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:36:13,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:36:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:36:13,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:13,277 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 63 states. [2018-10-04 14:36:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:13,463 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-04 14:36:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:36:13,464 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-10-04 14:36:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:13,465 INFO L225 Difference]: With dead ends: 253 [2018-10-04 14:36:13,465 INFO L226 Difference]: Without dead ends: 251 [2018-10-04 14:36:13,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime 61 [2018-10-04 14:36:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-04 14:36:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-04 14:36:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-04 14:36:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-04 14:36:13,469 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 246 [2018-10-04 14:36:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:13,469 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-04 14:36:13,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:36:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-04 14:36:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-04 14:36:13,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:13,471 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:13,471 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:13,471 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 665290254, now seen corresponding path program 61 times [2018-10-04 14:36:13,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:14,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:14,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:14,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:15,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:36:15,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:36:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:36:15,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:15,071 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 64 states. [2018-10-04 14:36:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:15,230 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-04 14:36:15,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:36:15,230 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-10-04 14:36:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:15,232 INFO L225 Difference]: With dead ends: 257 [2018-10-04 14:36:15,232 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 14:36:15,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 62 [2018-10-04 14:36:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 14:36:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-04 14:36:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 14:36:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-04 14:36:15,236 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 250 [2018-10-04 14:36:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:15,236 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-04 14:36:15,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:36:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-04 14:36:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-04 14:36:15,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:15,237 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:15,237 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:15,237 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1066081464, now seen corresponding path program 62 times [2018-10-04 14:36:15,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:15,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:16,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:16,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:16,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:16,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:16,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:16,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:17,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:36:17,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:36:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:36:17,254 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:17,255 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 65 states. [2018-10-04 14:36:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:17,420 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-04 14:36:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:36:17,420 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-10-04 14:36:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:17,421 INFO L225 Difference]: With dead ends: 261 [2018-10-04 14:36:17,421 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 14:36:17,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime 63 [2018-10-04 14:36:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 14:36:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-04 14:36:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 14:36:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-04 14:36:17,425 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 254 [2018-10-04 14:36:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:17,425 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-04 14:36:17,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:36:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-04 14:36:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-04 14:36:17,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:17,427 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:17,427 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:17,427 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -116437406, now seen corresponding path program 63 times [2018-10-04 14:36:17,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:19,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:19,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:19,102 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-04 14:36:19,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:19,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:19,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:19,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:36:19,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:36:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:36:19,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:19,573 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 66 states. [2018-10-04 14:36:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:19,737 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-04 14:36:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:36:19,737 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-10-04 14:36:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:19,738 INFO L225 Difference]: With dead ends: 265 [2018-10-04 14:36:19,738 INFO L226 Difference]: Without dead ends: 263 [2018-10-04 14:36:19,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 64 [2018-10-04 14:36:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-04 14:36:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-04 14:36:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-04 14:36:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-04 14:36:19,741 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 258 [2018-10-04 14:36:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:19,742 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-04 14:36:19,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:36:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-04 14:36:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-04 14:36:19,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:19,743 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:19,744 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:19,744 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash 208575244, now seen corresponding path program 64 times [2018-10-04 14:36:19,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:19,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:19,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:19,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:19,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:20,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:20,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:20,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:20,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:20,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:20,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:36:21,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:36:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:36:21,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:21,378 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 67 states. [2018-10-04 14:36:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:21,554 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-04 14:36:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:36:21,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-04 14:36:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:21,556 INFO L225 Difference]: With dead ends: 269 [2018-10-04 14:36:21,556 INFO L226 Difference]: Without dead ends: 267 [2018-10-04 14:36:21,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 65 [2018-10-04 14:36:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-04 14:36:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-04 14:36:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-04 14:36:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-04 14:36:21,561 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 262 [2018-10-04 14:36:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:21,561 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-04 14:36:21,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:36:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-04 14:36:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 14:36:21,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:21,563 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:21,563 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:21,563 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1868332362, now seen corresponding path program 65 times [2018-10-04 14:36:21,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:21,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:21,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:23,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:23,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:23,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-04 14:36:23,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:23,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:24,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:36:24,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:36:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:36:24,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:24,095 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 68 states. [2018-10-04 14:36:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:24,320 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-04 14:36:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:36:24,320 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-10-04 14:36:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:24,322 INFO L225 Difference]: With dead ends: 273 [2018-10-04 14:36:24,322 INFO L226 Difference]: Without dead ends: 271 [2018-10-04 14:36:24,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.7s impTime 66 [2018-10-04 14:36:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-04 14:36:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-04 14:36:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-04 14:36:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-04 14:36:24,326 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 266 [2018-10-04 14:36:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:24,326 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-04 14:36:24,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:36:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-04 14:36:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-04 14:36:24,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:24,328 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:24,328 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:24,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1687648928, now seen corresponding path program 66 times [2018-10-04 14:36:24,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:24,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:25,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:25,462 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:25,468 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:25,555 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-04 14:36:25,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:25,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:36:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:36:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:36:26,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:26,025 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 69 states. [2018-10-04 14:36:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:26,189 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-04 14:36:26,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:36:26,189 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-10-04 14:36:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:26,191 INFO L225 Difference]: With dead ends: 277 [2018-10-04 14:36:26,191 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 14:36:26,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 67 [2018-10-04 14:36:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 14:36:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-04 14:36:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 14:36:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-04 14:36:26,194 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 270 [2018-10-04 14:36:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:26,195 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-04 14:36:26,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:36:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-04 14:36:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-04 14:36:26,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:26,197 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:26,197 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:26,197 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -516414710, now seen corresponding path program 67 times [2018-10-04 14:36:26,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:26,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:26,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:28,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:28,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:28,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:36:28,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:36:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:36:28,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:28,954 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 70 states. [2018-10-04 14:36:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:29,157 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-04 14:36:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:36:29,158 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-10-04 14:36:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:29,159 INFO L225 Difference]: With dead ends: 281 [2018-10-04 14:36:29,159 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 14:36:29,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.9s impTime 68 [2018-10-04 14:36:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 14:36:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-04 14:36:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-04 14:36:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-04 14:36:29,163 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 274 [2018-10-04 14:36:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:29,163 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-04 14:36:29,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:36:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-04 14:36:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-04 14:36:29,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:29,165 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:29,165 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:29,165 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1431100340, now seen corresponding path program 68 times [2018-10-04 14:36:29,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:31,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:31,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:31,327 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:31,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:31,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:31,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:36:32,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:36:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:36:32,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:32,000 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 71 states. [2018-10-04 14:36:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:32,238 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-04 14:36:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:36:32,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-10-04 14:36:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:32,240 INFO L225 Difference]: With dead ends: 285 [2018-10-04 14:36:32,240 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 14:36:32,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 1.8s impTime 69 [2018-10-04 14:36:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 14:36:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-04 14:36:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-04 14:36:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-04 14:36:32,244 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 278 [2018-10-04 14:36:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:32,244 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-04 14:36:32,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:36:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-04 14:36:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-04 14:36:32,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:32,246 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:32,246 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:32,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash -912183458, now seen corresponding path program 69 times [2018-10-04 14:36:32,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:32,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:32,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:33,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:33,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:33,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:33,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-04 14:36:33,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:33,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:34,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:34,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:36:34,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:36:34,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:36:34,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:34,312 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 72 states. [2018-10-04 14:36:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:34,501 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-04 14:36:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:36:34,501 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-10-04 14:36:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:34,503 INFO L225 Difference]: With dead ends: 289 [2018-10-04 14:36:34,503 INFO L226 Difference]: Without dead ends: 287 [2018-10-04 14:36:34,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.0s impTime 70 [2018-10-04 14:36:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-04 14:36:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-04 14:36:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-04 14:36:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-04 14:36:34,506 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 282 [2018-10-04 14:36:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:34,506 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-04 14:36:34,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:36:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-04 14:36:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-04 14:36:34,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:34,508 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:34,508 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:34,508 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1896899064, now seen corresponding path program 70 times [2018-10-04 14:36:34,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:34,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:35,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:35,847 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:35,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:35,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:36,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:36,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:36:36,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:36:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:36:36,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:36,345 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 73 states. [2018-10-04 14:36:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:36,606 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-04 14:36:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:36:36,606 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-10-04 14:36:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:36,608 INFO L225 Difference]: With dead ends: 293 [2018-10-04 14:36:36,608 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 14:36:36,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 71 [2018-10-04 14:36:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 14:36:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-04 14:36:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-04 14:36:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-04 14:36:36,611 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 286 [2018-10-04 14:36:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:36,611 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-04 14:36:36,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:36:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-04 14:36:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-04 14:36:36,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:36,613 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:36,613 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:36,613 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 347252658, now seen corresponding path program 71 times [2018-10-04 14:36:36,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:36,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:37,723 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:37,832 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-04 14:36:37,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:37,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:38,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:36:38,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:36:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:36:38,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:38,345 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 74 states. [2018-10-04 14:36:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:38,537 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-04 14:36:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:36:38,538 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-10-04 14:36:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:38,539 INFO L225 Difference]: With dead ends: 297 [2018-10-04 14:36:38,539 INFO L226 Difference]: Without dead ends: 295 [2018-10-04 14:36:38,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 72 [2018-10-04 14:36:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-04 14:36:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-04 14:36:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-04 14:36:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-04 14:36:38,541 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 290 [2018-10-04 14:36:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:38,542 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-04 14:36:38,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:36:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-04 14:36:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-04 14:36:38,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:38,544 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:38,544 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:38,544 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1994077092, now seen corresponding path program 72 times [2018-10-04 14:36:38,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:38,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:39,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:39,768 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:39,890 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-04 14:36:39,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:39,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:40,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:40,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 14:36:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:36:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:36:40,376 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:40,376 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 75 states. [2018-10-04 14:36:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:40,601 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-04 14:36:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:36:40,602 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-04 14:36:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:40,603 INFO L225 Difference]: With dead ends: 301 [2018-10-04 14:36:40,603 INFO L226 Difference]: Without dead ends: 299 [2018-10-04 14:36:40,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 73 [2018-10-04 14:36:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-04 14:36:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-04 14:36:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-04 14:36:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-04 14:36:40,606 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 294 [2018-10-04 14:36:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:40,606 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-04 14:36:40,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:36:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-04 14:36:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-04 14:36:40,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:40,608 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:40,608 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:40,608 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2034273286, now seen corresponding path program 73 times [2018-10-04 14:36:40,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:40,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:40,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:41,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:41,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:36:42,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:36:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:36:42,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:42,611 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 76 states. [2018-10-04 14:36:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:42,875 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-04 14:36:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:36:42,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-10-04 14:36:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:42,877 INFO L225 Difference]: With dead ends: 305 [2018-10-04 14:36:42,877 INFO L226 Difference]: Without dead ends: 303 [2018-10-04 14:36:42,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.9s impTime 74 [2018-10-04 14:36:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-04 14:36:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-04 14:36:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-04 14:36:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-04 14:36:42,880 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 298 [2018-10-04 14:36:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:42,880 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-04 14:36:42,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:36:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-04 14:36:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-04 14:36:42,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:42,882 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:42,882 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:42,882 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1891657392, now seen corresponding path program 74 times [2018-10-04 14:36:42,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:42,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:42,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:43,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:43,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:43,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:43,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:43,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:43,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:44,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 14:36:44,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:36:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:36:44,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:44,335 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 77 states. [2018-10-04 14:36:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:44,544 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-04 14:36:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:36:44,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-10-04 14:36:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:44,546 INFO L225 Difference]: With dead ends: 309 [2018-10-04 14:36:44,546 INFO L226 Difference]: Without dead ends: 307 [2018-10-04 14:36:44,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 75 [2018-10-04 14:36:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-04 14:36:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-04 14:36:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 14:36:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-04 14:36:44,550 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 302 [2018-10-04 14:36:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:44,550 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-04 14:36:44,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:36:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-04 14:36:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-04 14:36:44,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:44,552 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:44,552 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:44,552 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:44,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1709253542, now seen corresponding path program 75 times [2018-10-04 14:36:44,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:44,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:44,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:46,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:46,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-04 14:36:46,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:46,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:46,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:36:46,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:36:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:36:46,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:46,802 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 78 states. [2018-10-04 14:36:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:47,137 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-04 14:36:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:36:47,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-10-04 14:36:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:47,139 INFO L225 Difference]: With dead ends: 313 [2018-10-04 14:36:47,139 INFO L226 Difference]: Without dead ends: 311 [2018-10-04 14:36:47,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 76 [2018-10-04 14:36:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-04 14:36:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-04 14:36:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-04 14:36:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-04 14:36:47,142 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 306 [2018-10-04 14:36:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:47,142 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-04 14:36:47,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:36:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-04 14:36:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-04 14:36:47,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:47,143 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:47,144 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:47,144 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1586916612, now seen corresponding path program 76 times [2018-10-04 14:36:47,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:47,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:47,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:48,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:48,049 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:48,114 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:48,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:48,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:48,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:48,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 14:36:48,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:36:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:36:48,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:48,654 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 79 states. [2018-10-04 14:36:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:48,878 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-04 14:36:48,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:36:48,879 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-10-04 14:36:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:48,880 INFO L225 Difference]: With dead ends: 317 [2018-10-04 14:36:48,880 INFO L226 Difference]: Without dead ends: 315 [2018-10-04 14:36:48,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.6s impTime 77 [2018-10-04 14:36:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-04 14:36:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-04 14:36:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 14:36:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-04 14:36:48,883 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 310 [2018-10-04 14:36:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:48,883 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-04 14:36:48,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:36:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-04 14:36:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-04 14:36:48,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:48,884 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:48,885 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:48,885 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 102865070, now seen corresponding path program 77 times [2018-10-04 14:36:48,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:48,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:50,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:50,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:50,182 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-04 14:36:50,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:50,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 14:36:50,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:36:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:36:50,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:50,714 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 80 states. [2018-10-04 14:36:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:50,982 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-04 14:36:50,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:36:50,982 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-10-04 14:36:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:50,984 INFO L225 Difference]: With dead ends: 321 [2018-10-04 14:36:50,984 INFO L226 Difference]: Without dead ends: 319 [2018-10-04 14:36:50,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 78 [2018-10-04 14:36:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-04 14:36:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-04 14:36:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-04 14:36:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-04 14:36:50,988 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 314 [2018-10-04 14:36:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:50,988 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-04 14:36:50,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:36:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-04 14:36:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-04 14:36:50,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:50,990 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:50,990 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:50,990 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1467670360, now seen corresponding path program 78 times [2018-10-04 14:36:50,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:50,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:50,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:52,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:52,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:52,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:52,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-04 14:36:52,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:52,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:52,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:52,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 14:36:52,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:36:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:36:52,984 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:52,984 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 81 states. [2018-10-04 14:36:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:53,245 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-04 14:36:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 14:36:53,245 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-10-04 14:36:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:53,247 INFO L225 Difference]: With dead ends: 325 [2018-10-04 14:36:53,247 INFO L226 Difference]: Without dead ends: 323 [2018-10-04 14:36:53,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.9s impTime 79 [2018-10-04 14:36:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-04 14:36:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-04 14:36:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-04 14:36:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-04 14:36:53,251 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 318 [2018-10-04 14:36:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:53,251 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-04 14:36:53,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:36:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-04 14:36:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-04 14:36:53,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:53,253 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:53,253 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:53,253 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash 941408514, now seen corresponding path program 79 times [2018-10-04 14:36:53,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:53,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:54,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:54,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 14:36:54,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 14:36:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 14:36:54,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:54,828 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 82 states. [2018-10-04 14:36:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:55,067 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-04 14:36:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:36:55,067 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-10-04 14:36:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:55,069 INFO L225 Difference]: With dead ends: 329 [2018-10-04 14:36:55,069 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 14:36:55,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.6s impTime 80 [2018-10-04 14:36:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 14:36:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-04 14:36:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-04 14:36:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-04 14:36:55,072 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 322 [2018-10-04 14:36:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:55,072 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-04 14:36:55,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 14:36:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-04 14:36:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-04 14:36:55,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:55,074 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:55,074 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:55,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1279376812, now seen corresponding path program 80 times [2018-10-04 14:36:55,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:56,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:56,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:56,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:56,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:56,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:57,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:57,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 14:36:57,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 14:36:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 14:36:57,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:57,339 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 83 states. [2018-10-04 14:36:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:57,719 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-10-04 14:36:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 14:36:57,720 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-10-04 14:36:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:57,721 INFO L225 Difference]: With dead ends: 333 [2018-10-04 14:36:57,721 INFO L226 Difference]: Without dead ends: 331 [2018-10-04 14:36:57,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 81 [2018-10-04 14:36:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-04 14:36:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-04 14:36:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-04 14:36:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-04 14:36:57,725 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 326 [2018-10-04 14:36:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-04 14:36:57,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 14:36:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-04 14:36:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-04 14:36:57,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:57,727 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-10-04 14:36:57,727 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:57,727 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1763420842, now seen corresponding path program 81 times [2018-10-04 14:36:57,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:57,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:57,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:57,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:58,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:58,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:58,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-04 14:36:58,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:58,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:59,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:59,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 14:36:59,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 14:36:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 14:36:59,577 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:59,577 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 84 states. [2018-10-04 14:37:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:00,169 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-04 14:37:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:37:00,169 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-10-04 14:37:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:00,171 INFO L225 Difference]: With dead ends: 337 [2018-10-04 14:37:00,171 INFO L226 Difference]: Without dead ends: 335 [2018-10-04 14:37:00,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 82 [2018-10-04 14:37:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-04 14:37:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-04 14:37:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-04 14:37:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-04 14:37:00,175 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 330 [2018-10-04 14:37:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:00,176 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-04 14:37:00,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 14:37:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-04 14:37:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-04 14:37:00,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:00,178 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:00,179 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:00,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:00,179 INFO L82 PathProgramCache]: Analyzing trace with hash 431949824, now seen corresponding path program 82 times [2018-10-04 14:37:00,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:00,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:00,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:00,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:02,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:02,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:02,307 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:02,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:02,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:03,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:03,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 14:37:03,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 14:37:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 14:37:03,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:03,304 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 85 states. [2018-10-04 14:37:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:03,572 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-04 14:37:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 14:37:03,578 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-10-04 14:37:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:03,579 INFO L225 Difference]: With dead ends: 341 [2018-10-04 14:37:03,580 INFO L226 Difference]: Without dead ends: 339 [2018-10-04 14:37:03,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.3s impTime 83 [2018-10-04 14:37:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-04 14:37:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-04 14:37:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-04 14:37:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-04 14:37:03,583 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 334 [2018-10-04 14:37:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:03,583 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-04 14:37:03,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 14:37:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-04 14:37:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-04 14:37:03,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:03,584 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:03,585 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:03,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:03,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1967936938, now seen corresponding path program 83 times [2018-10-04 14:37:03,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:03,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:03,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:04,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:04,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:04,876 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-04 14:37:04,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:04,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:05,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:05,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 14:37:05,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 14:37:05,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 14:37:05,480 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:05,480 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 86 states. [2018-10-04 14:37:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:05,790 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-04 14:37:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:37:05,790 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-10-04 14:37:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:05,792 INFO L225 Difference]: With dead ends: 345 [2018-10-04 14:37:05,792 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 14:37:05,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 84 [2018-10-04 14:37:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 14:37:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-04 14:37:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-04 14:37:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-04 14:37:05,796 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 338 [2018-10-04 14:37:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:05,796 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-04 14:37:05,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 14:37:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-04 14:37:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-04 14:37:05,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:05,798 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:05,798 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:05,798 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2000241068, now seen corresponding path program 84 times [2018-10-04 14:37:05,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:07,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:07,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:07,159 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:07,292 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-04 14:37:07,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:07,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:08,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:08,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 14:37:08,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 14:37:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 14:37:08,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:08,174 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 87 states. [2018-10-04 14:37:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:08,535 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-04 14:37:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 14:37:08,535 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-10-04 14:37:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:08,537 INFO L225 Difference]: With dead ends: 349 [2018-10-04 14:37:08,537 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 14:37:08,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.0s impTime 85 [2018-10-04 14:37:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 14:37:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-04 14:37:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-04 14:37:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-04 14:37:08,540 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 342 [2018-10-04 14:37:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:08,540 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-04 14:37:08,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 14:37:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-04 14:37:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-04 14:37:08,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:08,542 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:08,542 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:08,542 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash 304660990, now seen corresponding path program 85 times [2018-10-04 14:37:08,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:08,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:08,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:10,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:10,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:11,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:11,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 14:37:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 14:37:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 14:37:11,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:11,006 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 88 states. [2018-10-04 14:37:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:11,445 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-04 14:37:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 14:37:11,446 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-10-04 14:37:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:11,447 INFO L225 Difference]: With dead ends: 353 [2018-10-04 14:37:11,447 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 14:37:11,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 86 [2018-10-04 14:37:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 14:37:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-04 14:37:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 14:37:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-10-04 14:37:11,450 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 346 [2018-10-04 14:37:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:11,450 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-10-04 14:37:11,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 14:37:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-10-04 14:37:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-04 14:37:11,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:11,452 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:11,452 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:11,452 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1311563944, now seen corresponding path program 86 times [2018-10-04 14:37:11,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:11,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:11,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:13,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:13,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:13,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:13,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:13,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:13,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 14:37:14,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 14:37:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 14:37:14,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:14,116 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 89 states. [2018-10-04 14:37:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:14,541 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-04 14:37:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 14:37:14,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-10-04 14:37:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:14,543 INFO L225 Difference]: With dead ends: 357 [2018-10-04 14:37:14,543 INFO L226 Difference]: Without dead ends: 355 [2018-10-04 14:37:14,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.6s impTime 87 [2018-10-04 14:37:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-04 14:37:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-04 14:37:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-04 14:37:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-04 14:37:14,547 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 350 [2018-10-04 14:37:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:14,547 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-04 14:37:14,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 14:37:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-04 14:37:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-04 14:37:14,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:14,549 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:14,549 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:14,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744686, now seen corresponding path program 87 times [2018-10-04 14:37:14,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:15,826 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:15,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-04 14:37:15,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:15,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:16,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:16,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 14:37:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 14:37:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 14:37:16,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:16,607 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 90 states. [2018-10-04 14:37:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:16,944 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-04 14:37:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 14:37:16,945 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-10-04 14:37:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:16,947 INFO L225 Difference]: With dead ends: 361 [2018-10-04 14:37:16,947 INFO L226 Difference]: Without dead ends: 359 [2018-10-04 14:37:16,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.9s impTime 88 [2018-10-04 14:37:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-04 14:37:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-04 14:37:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-04 14:37:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-04 14:37:16,950 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 354 [2018-10-04 14:37:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:16,950 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-04 14:37:16,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 14:37:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-04 14:37:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-04 14:37:16,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:16,952 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:16,952 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:16,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash 180711164, now seen corresponding path program 88 times [2018-10-04 14:37:16,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:16,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:18,597 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:18,686 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:18,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:18,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 14:37:19,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 14:37:19,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 14:37:19,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:19,385 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 91 states. [2018-10-04 14:37:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:19,759 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-04 14:37:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 14:37:19,760 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-10-04 14:37:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:19,761 INFO L225 Difference]: With dead ends: 365 [2018-10-04 14:37:19,761 INFO L226 Difference]: Without dead ends: 363 [2018-10-04 14:37:19,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.3s impTime 89 [2018-10-04 14:37:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-04 14:37:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-04 14:37:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-04 14:37:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-04 14:37:19,765 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 358 [2018-10-04 14:37:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:19,765 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-04 14:37:19,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 14:37:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-04 14:37:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-04 14:37:19,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:19,767 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:19,767 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:19,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash 512679590, now seen corresponding path program 89 times [2018-10-04 14:37:19,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:21,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:21,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:21,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:21,997 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-04 14:37:21,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:22,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:22,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:22,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 14:37:22,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:37:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:37:22,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:22,653 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 92 states. [2018-10-04 14:37:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:23,123 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-10-04 14:37:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:37:23,123 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-10-04 14:37:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:23,124 INFO L225 Difference]: With dead ends: 369 [2018-10-04 14:37:23,125 INFO L226 Difference]: Without dead ends: 367 [2018-10-04 14:37:23,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.7s impTime 90 [2018-10-04 14:37:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-04 14:37:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-04 14:37:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-04 14:37:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-04 14:37:23,128 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 362 [2018-10-04 14:37:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:23,128 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-04 14:37:23,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:37:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-04 14:37:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-04 14:37:23,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:23,129 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:23,130 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:23,130 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1264871760, now seen corresponding path program 90 times [2018-10-04 14:37:23,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:23,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:24,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:24,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:24,695 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-04 14:37:24,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:24,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:25,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-04 14:37:25,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-04 14:37:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-04 14:37:25,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:25,359 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 93 states. [2018-10-04 14:37:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:25,840 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-04 14:37:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-04 14:37:25,840 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 366 [2018-10-04 14:37:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:25,842 INFO L225 Difference]: With dead ends: 373 [2018-10-04 14:37:25,842 INFO L226 Difference]: Without dead ends: 371 [2018-10-04 14:37:25,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.0s impTime 91 [2018-10-04 14:37:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-04 14:37:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-04 14:37:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-04 14:37:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-04 14:37:25,846 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 366 [2018-10-04 14:37:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:25,846 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-04 14:37:25,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-04 14:37:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-04 14:37:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-04 14:37:25,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:25,848 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:25,848 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:25,848 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1480552710, now seen corresponding path program 91 times [2018-10-04 14:37:25,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:25,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:25,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:25,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:25,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:27,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:27,893 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:27,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-04 14:37:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 14:37:28,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 14:37:28,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:28,847 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 94 states. [2018-10-04 14:37:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:29,319 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-04 14:37:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-04 14:37:29,320 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 370 [2018-10-04 14:37:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:29,322 INFO L225 Difference]: With dead ends: 377 [2018-10-04 14:37:29,322 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 14:37:29,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.7s impTime 92 [2018-10-04 14:37:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 14:37:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-10-04 14:37:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-04 14:37:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-04 14:37:29,325 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 370 [2018-10-04 14:37:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:29,326 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-04 14:37:29,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 14:37:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-04 14:37:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-04 14:37:29,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:29,327 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:29,327 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:29,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1998729308, now seen corresponding path program 92 times [2018-10-04 14:37:29,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:29,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:31,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:31,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:31,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:31,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:31,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:31,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-04 14:37:32,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 14:37:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 14:37:32,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:32,365 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 95 states. [2018-10-04 14:37:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:32,904 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-10-04 14:37:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 14:37:32,905 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 374 [2018-10-04 14:37:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:32,907 INFO L225 Difference]: With dead ends: 381 [2018-10-04 14:37:32,907 INFO L226 Difference]: Without dead ends: 379 [2018-10-04 14:37:32,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.9s impTime 93 [2018-10-04 14:37:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-04 14:37:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-04 14:37:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-04 14:37:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-04 14:37:32,911 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 374 [2018-10-04 14:37:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:32,911 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-04 14:37:32,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 14:37:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-04 14:37:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-04 14:37:32,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:32,913 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:32,913 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:32,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 582396750, now seen corresponding path program 93 times [2018-10-04 14:37:32,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:32,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:35,403 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:35,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-04 14:37:35,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:35,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:36,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:36,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-04 14:37:36,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 14:37:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 14:37:36,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:36,247 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 96 states. [2018-10-04 14:37:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:36,780 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-04 14:37:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:37:36,781 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 378 [2018-10-04 14:37:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:36,783 INFO L225 Difference]: With dead ends: 385 [2018-10-04 14:37:36,783 INFO L226 Difference]: Without dead ends: 383 [2018-10-04 14:37:36,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.0s impTime 94 [2018-10-04 14:37:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-04 14:37:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-10-04 14:37:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-04 14:37:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-04 14:37:36,787 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 378 [2018-10-04 14:37:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:36,787 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-04 14:37:36,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 14:37:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-04 14:37:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-04 14:37:36,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:36,789 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:36,789 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:36,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 671457784, now seen corresponding path program 94 times [2018-10-04 14:37:36,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:36,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:36,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:38,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:38,558 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:38,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:38,641 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:38,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:38,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-04 14:37:39,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-04 14:37:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-04 14:37:39,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:39,380 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 97 states. [2018-10-04 14:37:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:39,784 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-04 14:37:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-04 14:37:39,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 382 [2018-10-04 14:37:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:39,786 INFO L225 Difference]: With dead ends: 389 [2018-10-04 14:37:39,786 INFO L226 Difference]: Without dead ends: 387 [2018-10-04 14:37:39,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.3s impTime 95 [2018-10-04 14:37:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-04 14:37:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-10-04 14:37:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-04 14:37:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-04 14:37:39,789 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 382 [2018-10-04 14:37:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:39,789 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-04 14:37:39,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-04 14:37:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-04 14:37:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-04 14:37:39,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:39,791 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:39,791 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:39,791 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1782920098, now seen corresponding path program 95 times [2018-10-04 14:37:39,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:39,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:39,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:41,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:41,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:41,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:41,637 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-04 14:37:41,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:41,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-04 14:37:42,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 14:37:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 14:37:42,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:42,346 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 98 states. [2018-10-04 14:37:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:42,822 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-04 14:37:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-04 14:37:42,822 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 386 [2018-10-04 14:37:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:42,824 INFO L225 Difference]: With dead ends: 393 [2018-10-04 14:37:42,824 INFO L226 Difference]: Without dead ends: 391 [2018-10-04 14:37:42,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 96 [2018-10-04 14:37:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-04 14:37:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-10-04 14:37:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-04 14:37:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-10-04 14:37:42,827 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 386 [2018-10-04 14:37:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:42,827 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-10-04 14:37:42,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 14:37:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-10-04 14:37:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-04 14:37:42,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:42,829 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:42,829 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:42,829 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2041569356, now seen corresponding path program 96 times [2018-10-04 14:37:42,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:42,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:44,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:44,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:44,774 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-04 14:37:44,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:44,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:45,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:45,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-04 14:37:45,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-04 14:37:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-04 14:37:45,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:45,460 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 99 states. [2018-10-04 14:37:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:45,833 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-10-04 14:37:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-04 14:37:45,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 390 [2018-10-04 14:37:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:45,835 INFO L225 Difference]: With dead ends: 397 [2018-10-04 14:37:45,835 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 14:37:45,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.4s impTime 97 [2018-10-04 14:37:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 14:37:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 14:37:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 14:37:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-04 14:37:45,838 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 390 [2018-10-04 14:37:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:45,839 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-04 14:37:45,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-04 14:37:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-04 14:37:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-04 14:37:45,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:45,840 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:45,840 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:45,841 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1161832438, now seen corresponding path program 97 times [2018-10-04 14:37:45,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:45,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:47,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:47,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:47,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:48,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-04 14:37:48,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 14:37:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 14:37:48,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:48,342 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 100 states. [2018-10-04 14:37:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:48,788 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-04 14:37:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-04 14:37:48,788 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 394 [2018-10-04 14:37:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:48,790 INFO L225 Difference]: With dead ends: 401 [2018-10-04 14:37:48,790 INFO L226 Difference]: Without dead ends: 399 [2018-10-04 14:37:48,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.3s impTime 98 [2018-10-04 14:37:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-04 14:37:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-10-04 14:37:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-04 14:37:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-10-04 14:37:48,794 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 394 [2018-10-04 14:37:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:48,794 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-10-04 14:37:48,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 14:37:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-10-04 14:37:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-04 14:37:48,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:48,796 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:48,796 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:48,796 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1162835296, now seen corresponding path program 98 times [2018-10-04 14:37:48,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:50,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:50,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:50,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:50,516 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:50,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:50,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:51,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:51,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-04 14:37:51,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 14:37:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 14:37:51,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:51,235 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 101 states. [2018-10-04 14:37:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:51,660 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-10-04 14:37:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 14:37:51,661 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 398 [2018-10-04 14:37:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:51,662 INFO L225 Difference]: With dead ends: 405 [2018-10-04 14:37:51,662 INFO L226 Difference]: Without dead ends: 403 [2018-10-04 14:37:51,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.2s impTime 99 [2018-10-04 14:37:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-04 14:37:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-04 14:37:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 14:37:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-04 14:37:51,666 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 398 [2018-10-04 14:37:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:51,666 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-04 14:37:51,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 14:37:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-04 14:37:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-04 14:37:51,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:51,668 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:51,668 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:51,669 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1719371850, now seen corresponding path program 99 times [2018-10-04 14:37:51,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:51,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:53,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:53,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:53,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-10-04 14:37:53,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:53,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:54,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-04 14:37:54,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 14:37:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 14:37:54,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:54,513 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 102 states. [2018-10-04 14:37:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:54,974 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-04 14:37:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-04 14:37:54,974 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 402 [2018-10-04 14:37:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:54,976 INFO L225 Difference]: With dead ends: 409 [2018-10-04 14:37:54,976 INFO L226 Difference]: Without dead ends: 407 [2018-10-04 14:37:54,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.2s impTime 100 [2018-10-04 14:37:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-04 14:37:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-10-04 14:37:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-04 14:37:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-04 14:37:54,980 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 402 [2018-10-04 14:37:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:54,981 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-04 14:37:54,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 14:37:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-04 14:37:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-04 14:37:54,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:54,983 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:54,983 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:54,983 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 333160692, now seen corresponding path program 100 times [2018-10-04 14:37:54,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:57,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:57,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:57,451 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:57,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:57,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:58,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:58,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-04 14:37:58,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 14:37:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 14:37:58,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:58,189 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 103 states. [2018-10-04 14:37:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:58,760 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-04 14:37:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 14:37:58,760 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 406 [2018-10-04 14:37:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:58,763 INFO L225 Difference]: With dead ends: 413 [2018-10-04 14:37:58,763 INFO L226 Difference]: Without dead ends: 411 [2018-10-04 14:37:58,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 101 [2018-10-04 14:37:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-04 14:37:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-10-04 14:37:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-04 14:37:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-04 14:37:58,767 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 406 [2018-10-04 14:37:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:58,768 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-04 14:37:58,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 14:37:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-04 14:37:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-04 14:37:58,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:58,770 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-10-04 14:37:58,770 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:58,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1825264798, now seen corresponding path program 101 times [2018-10-04 14:37:58,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:01,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:01,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:01,253 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2018-10-04 14:38:01,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:01,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-04 14:38:02,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 14:38:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 14:38:02,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:02,289 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 104 states. [2018-10-04 14:38:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:02,924 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-10-04 14:38:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:38:02,924 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 410 [2018-10-04 14:38:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:02,925 INFO L225 Difference]: With dead ends: 417 [2018-10-04 14:38:02,925 INFO L226 Difference]: Without dead ends: 415 [2018-10-04 14:38:02,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 1.8s impTime 102 [2018-10-04 14:38:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-04 14:38:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-10-04 14:38:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-04 14:38:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-10-04 14:38:02,929 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 410 [2018-10-04 14:38:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:02,930 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-10-04 14:38:02,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 14:38:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-10-04 14:38:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-04 14:38:02,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:02,932 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:02,932 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:02,932 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1710939320, now seen corresponding path program 102 times [2018-10-04 14:38:02,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:02,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:05,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:05,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:05,377 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2018-10-04 14:38:05,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:05,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:06,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-04 14:38:06,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-04 14:38:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-04 14:38:06,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:06,129 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 105 states. [2018-10-04 14:38:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:06,717 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-04 14:38:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-04 14:38:06,718 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 414 [2018-10-04 14:38:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:06,719 INFO L225 Difference]: With dead ends: 421 [2018-10-04 14:38:06,719 INFO L226 Difference]: Without dead ends: 419 [2018-10-04 14:38:06,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 1.8s impTime 103 [2018-10-04 14:38:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-04 14:38:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-10-04 14:38:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-04 14:38:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-10-04 14:38:06,723 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 414 [2018-10-04 14:38:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:06,724 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-10-04 14:38:06,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-04 14:38:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-10-04 14:38:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-04 14:38:06,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:06,726 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:06,726 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:06,726 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash -486306574, now seen corresponding path program 103 times [2018-10-04 14:38:06,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:09,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:09,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:09,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-04 14:38:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 14:38:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 14:38:09,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:09,965 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 106 states. [2018-10-04 14:38:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:10,606 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-04 14:38:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-04 14:38:10,607 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 418 [2018-10-04 14:38:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:10,608 INFO L225 Difference]: With dead ends: 425 [2018-10-04 14:38:10,608 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 14:38:10,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.8s impTime 104 [2018-10-04 14:38:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 14:38:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-10-04 14:38:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-04 14:38:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-04 14:38:10,612 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 418 [2018-10-04 14:38:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:10,613 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-04 14:38:10,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 14:38:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-04 14:38:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-04 14:38:10,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:10,615 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:10,615 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:10,615 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1308692892, now seen corresponding path program 104 times [2018-10-04 14:38:10,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:10,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:13,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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:13,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:13,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:13,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:13,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:14,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:14,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-04 14:38:14,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-04 14:38:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-04 14:38:14,008 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:14,008 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 107 states. [2018-10-04 14:38:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:14,617 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-04 14:38:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-04 14:38:14,617 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 422 [2018-10-04 14:38:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:14,618 INFO L225 Difference]: With dead ends: 429 [2018-10-04 14:38:14,618 INFO L226 Difference]: Without dead ends: 427 [2018-10-04 14:38:14,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.1s impTime 105 [2018-10-04 14:38:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-04 14:38:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-10-04 14:38:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-04 14:38:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-04 14:38:14,622 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 422 [2018-10-04 14:38:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:14,622 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-04 14:38:14,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-04 14:38:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-04 14:38:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-04 14:38:14,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:14,624 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:14,624 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:14,624 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1073230150, now seen corresponding path program 105 times [2018-10-04 14:38:14,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:14,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:14,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:16,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:16,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:16,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:16,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-10-04 14:38:16,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:16,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:17,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-04 14:38:17,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 14:38:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 14:38:17,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:17,436 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 108 states. [2018-10-04 14:38:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:17,979 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-10-04 14:38:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-04 14:38:17,979 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 426 [2018-10-04 14:38:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:17,980 INFO L225 Difference]: With dead ends: 433 [2018-10-04 14:38:17,980 INFO L226 Difference]: Without dead ends: 431 [2018-10-04 14:38:17,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.4s impTime 106 [2018-10-04 14:38:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-04 14:38:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-04 14:38:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-04 14:38:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-04 14:38:17,983 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 426 [2018-10-04 14:38:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:17,983 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-04 14:38:17,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 14:38:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-04 14:38:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-04 14:38:17,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:17,985 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:17,985 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:17,985 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 480472048, now seen corresponding path program 106 times [2018-10-04 14:38:17,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:17,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:17,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:20,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:20,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:20,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:20,468 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:20,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:20,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:21,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:21,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-04 14:38:21,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-04 14:38:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-04 14:38:21,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:21,240 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 109 states. [2018-10-04 14:38:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:21,827 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-10-04 14:38:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-04 14:38:21,827 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 430 [2018-10-04 14:38:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:21,828 INFO L225 Difference]: With dead ends: 437 [2018-10-04 14:38:21,828 INFO L226 Difference]: Without dead ends: 435 [2018-10-04 14:38:21,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 107 [2018-10-04 14:38:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-04 14:38:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-10-04 14:38:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-04 14:38:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-10-04 14:38:21,831 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 430 [2018-10-04 14:38:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:21,831 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-10-04 14:38:21,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-04 14:38:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-10-04 14:38:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-04 14:38:21,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:21,833 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:21,833 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:21,833 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -427998822, now seen corresponding path program 107 times [2018-10-04 14:38:21,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:24,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:24,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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:24,459 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:24,684 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2018-10-04 14:38:24,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:24,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:25,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-04 14:38:25,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 14:38:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 14:38:25,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:25,466 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 110 states. [2018-10-04 14:38:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:26,170 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-10-04 14:38:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-04 14:38:26,170 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 434 [2018-10-04 14:38:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:26,171 INFO L225 Difference]: With dead ends: 441 [2018-10-04 14:38:26,171 INFO L226 Difference]: Without dead ends: 439 [2018-10-04 14:38:26,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.1s impTime 108 [2018-10-04 14:38:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-04 14:38:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-10-04 14:38:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-04 14:38:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-10-04 14:38:26,174 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 434 [2018-10-04 14:38:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:26,174 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-10-04 14:38:26,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 14:38:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-10-04 14:38:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-04 14:38:26,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:26,176 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:26,176 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:26,176 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash -557829564, now seen corresponding path program 108 times [2018-10-04 14:38:26,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:26,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:28,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:28,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:28,486 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2018-10-04 14:38:28,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:28,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:29,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:29,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-04 14:38:29,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-04 14:38:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-04 14:38:29,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:29,277 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 111 states. [2018-10-04 14:38:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:29,887 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-04 14:38:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-04 14:38:29,888 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 438 [2018-10-04 14:38:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:29,889 INFO L225 Difference]: With dead ends: 445 [2018-10-04 14:38:29,889 INFO L226 Difference]: Without dead ends: 443 [2018-10-04 14:38:29,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.7s impTime 109 [2018-10-04 14:38:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-04 14:38:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-10-04 14:38:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-04 14:38:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-04 14:38:29,892 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 438 [2018-10-04 14:38:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:29,893 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-04 14:38:29,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-04 14:38:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-04 14:38:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-04 14:38:29,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:29,895 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:29,895 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:29,895 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 627490286, now seen corresponding path program 109 times [2018-10-04 14:38:29,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:31,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:31,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:32,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:32,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-04 14:38:32,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 14:38:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 14:38:32,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:32,874 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 112 states. [2018-10-04 14:38:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:33,493 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-04 14:38:33,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-04 14:38:33,494 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 442 [2018-10-04 14:38:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:33,495 INFO L225 Difference]: With dead ends: 449 [2018-10-04 14:38:33,495 INFO L226 Difference]: Without dead ends: 447 [2018-10-04 14:38:33,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.6s impTime 110 [2018-10-04 14:38:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-04 14:38:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-10-04 14:38:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-04 14:38:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-04 14:38:33,497 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 442 [2018-10-04 14:38:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:33,498 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-04 14:38:33,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 14:38:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-04 14:38:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-04 14:38:33,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:33,499 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:33,499 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:33,500 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1496016024, now seen corresponding path program 110 times [2018-10-04 14:38:33,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:36,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:36,072 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:36,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:36,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:36,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:36,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:36,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:36,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-10-04 14:38:36,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-04 14:38:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-04 14:38:36,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:36,994 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 113 states. [2018-10-04 14:38:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:37,600 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-10-04 14:38:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-04 14:38:37,600 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 446 [2018-10-04 14:38:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:37,602 INFO L225 Difference]: With dead ends: 453 [2018-10-04 14:38:37,602 INFO L226 Difference]: Without dead ends: 451 [2018-10-04 14:38:37,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.1s impTime 111 [2018-10-04 14:38:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-04 14:38:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-10-04 14:38:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-04 14:38:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-04 14:38:37,604 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 446 [2018-10-04 14:38:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-04 14:38:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-04 14:38:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-04 14:38:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-04 14:38:37,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:37,606 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 111, 111, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:37,606 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:37,607 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 931702338, now seen corresponding path program 111 times [2018-10-04 14:38:37,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:37,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:40,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:40,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:40,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2018-10-04 14:38:40,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:41,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-04 14:38:41,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 14:38:41,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 14:38:41,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:41,709 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 114 states. [2018-10-04 14:38:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:42,579 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-04 14:38:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-04 14:38:42,580 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 450 [2018-10-04 14:38:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:42,581 INFO L225 Difference]: With dead ends: 457 [2018-10-04 14:38:42,581 INFO L226 Difference]: Without dead ends: 455 [2018-10-04 14:38:42,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 2.6s impTime 112 [2018-10-04 14:38:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-04 14:38:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-04 14:38:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 14:38:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 455 transitions. [2018-10-04 14:38:42,584 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 455 transitions. Word has length 450 [2018-10-04 14:38:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 455 transitions. [2018-10-04 14:38:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 14:38:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 455 transitions. [2018-10-04 14:38:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-04 14:38:42,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:42,586 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 112, 112, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:42,586 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:42,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1018757868, now seen corresponding path program 112 times [2018-10-04 14:38:42,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:42,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:42,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:45,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:45,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:45,443 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:45,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:45,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:46,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:46,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2018-10-04 14:38:46,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-04 14:38:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-04 14:38:46,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:46,308 INFO L87 Difference]: Start difference. First operand 455 states and 455 transitions. Second operand 115 states. [2018-10-04 14:38:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:47,101 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-10-04 14:38:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-04 14:38:47,101 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 454 [2018-10-04 14:38:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:47,103 INFO L225 Difference]: With dead ends: 461 [2018-10-04 14:38:47,103 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 14:38:47,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.3s impTime 113 [2018-10-04 14:38:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 14:38:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-10-04 14:38:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-04 14:38:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-04 14:38:47,106 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 454 [2018-10-04 14:38:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:47,106 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-04 14:38:47,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-04 14:38:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-04 14:38:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-04 14:38:47,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:47,108 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 113, 113, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:47,108 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:47,108 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1136065174, now seen corresponding path program 113 times [2018-10-04 14:38:47,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:47,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:47,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:50,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:50,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:50,822 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2018-10-04 14:38:50,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:50,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:51,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:51,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-04 14:38:51,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 14:38:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 14:38:51,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:51,807 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 116 states. [2018-10-04 14:38:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:52,684 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-10-04 14:38:52,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-04 14:38:52,684 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 458 [2018-10-04 14:38:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:52,685 INFO L225 Difference]: With dead ends: 465 [2018-10-04 14:38:52,685 INFO L226 Difference]: Without dead ends: 463 [2018-10-04 14:38:52,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.0s impTime 114 [2018-10-04 14:38:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-04 14:38:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-10-04 14:38:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-10-04 14:38:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-10-04 14:38:52,690 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 458 [2018-10-04 14:38:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:52,690 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-10-04 14:38:52,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 14:38:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-10-04 14:38:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-04 14:38:52,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:52,692 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:52,692 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:52,692 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash 641535296, now seen corresponding path program 114 times [2018-10-04 14:38:52,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:52,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:52,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:54,673 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:54,883 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2018-10-04 14:38:54,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:54,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:55,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:55,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-10-04 14:38:55,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-04 14:38:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-04 14:38:55,832 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:55,832 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 117 states. [2018-10-04 14:38:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:56,398 INFO L93 Difference]: Finished difference Result 469 states and 469 transitions. [2018-10-04 14:38:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-04 14:38:56,399 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 462 [2018-10-04 14:38:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:56,400 INFO L225 Difference]: With dead ends: 469 [2018-10-04 14:38:56,400 INFO L226 Difference]: Without dead ends: 467 [2018-10-04 14:38:56,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.5s impTime 115 [2018-10-04 14:38:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-04 14:38:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-10-04 14:38:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-04 14:38:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 467 transitions. [2018-10-04 14:38:56,403 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 467 transitions. Word has length 462 [2018-10-04 14:38:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:56,404 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 467 transitions. [2018-10-04 14:38:56,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-04 14:38:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 467 transitions. [2018-10-04 14:38:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-04 14:38:56,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:56,406 INFO L375 BasicCegarLoop]: trace histogram [115, 115, 115, 115, 1, 1, 1, 1, 1, 1] [2018-10-04 14:38:56,406 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:56,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1556462314, now seen corresponding path program 115 times [2018-10-04 14:38:56,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:56,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:56,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 14:38:57,292 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:38:57,296 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:38:57,296 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:38:57 BoogieIcfgContainer [2018-10-04 14:38:57,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:38:57,297 INFO L168 Benchmark]: Toolchain (without parser) took 239701.91 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.1 MB). Free memory was 1.5 GB in the beginning and 891.7 MB in the end (delta: 582.3 MB). Peak memory consumption was 725.4 MB. Max. memory is 7.1 GB. [2018-10-04 14:38:57,299 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:38:57,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.69 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 14:38:57,300 INFO L168 Benchmark]: Boogie Preprocessor took 20.58 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 14:38:57,300 INFO L168 Benchmark]: RCFGBuilder took 434.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:38:57,301 INFO L168 Benchmark]: TraceAbstraction took 239200.40 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.1 MB). Free memory was 1.5 GB in the beginning and 891.7 MB in the end (delta: 561.2 MB). Peak memory consumption was 704.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:38:57,304 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.69 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 20.58 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 434.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239200.40 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.1 MB). Free memory was 1.5 GB in the beginning and 891.7 MB in the end (delta: 561.2 MB). Peak memory consumption was 704.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 467 with TraceHistMax 115, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 465 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. TIMEOUT Result, 239.1s OverallTime, 117 OverallIterations, 115 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1044 SDtfs, 732 SDslu, 23042 SDs, 0 SdLazy, 9821 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33577 GetRequests, 26906 SyntacticMatches, 0 SemanticMatches, 6671 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 175.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=116, 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, 116 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 188.3s InterpolantComputationTime, 53820 NumberOfCodeBlocks, 53820 NumberOfCodeBlocksAsserted, 3612 NumberOfCheckSat, 53590 ConstructedInterpolants, 0 QuantifiedInterpolants, 49518290 SizeOfPredicates, 114 NumberOfNonLiveVariables, 40698 ConjunctsInSsa, 6783 ConjunctsInUnsatCore, 230 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1988350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-ArraysIntegefied.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-38-57-314.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-ArraysIntegefied.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-38-57-314.csv Completed graceful shutdown