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/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:33:36,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:33:36,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:33:36,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:33:36,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:33:36,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:33:36,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:33:36,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:33:36,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:33:36,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:33:36,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:33:36,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:33:36,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:33:36,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:33:36,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:33:36,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:33:36,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:33:36,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:33:36,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:33:36,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:33:36,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:33:36,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:33:36,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:33:36,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:33:36,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:33:36,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:33:36,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:33:36,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:33:36,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:33:36,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:33:36,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:33:36,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:33:36,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:33:36,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:33:36,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:33:36,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:33:36,107 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:33:36,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:33:36,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:33:36,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:33:36,134 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:33:36,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:33:36,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:33:36,135 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:33:36,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:33:36,135 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:33:36,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:33:36,135 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:33:36,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:33:36,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:33:36,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:33:36,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:33:36,136 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:33:36,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:33:36,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:33:36,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:33:36,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:33:36,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:33:36,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:33:36,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:33:36,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:33:36,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:33:36,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:33:36,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:33:36,141 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:33:36,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:33:36,141 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:33:36,141 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:33:36,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:33:36,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:33:36,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:33:36,216 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:33:36,216 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:33:36,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-04 14:33:36,217 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-04 14:33:36,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:33:36,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:33:36,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:33:36,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:33:36,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:33:36,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,300 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:33:36,301 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:33:36,301 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:33:36,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:33:36,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:33:36,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:33:36,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:33:36,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/1) ... [2018-10-04 14:33:36,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:33:36,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:33:36,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:33:36,324 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:33:36,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (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:33:36,379 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-04 14:33:36,379 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-04 14:33:36,553 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:33:36,554 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:33:36 BoogieIcfgContainer [2018-10-04 14:33:36,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:33:36,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:33:36,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:33:36,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:33:36,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:36" (1/2) ... [2018-10-04 14:33:36,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16142219 and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:33:36, skipping insertion in model container [2018-10-04 14:33:36,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:33:36" (2/2) ... [2018-10-04 14:33:36,563 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-04 14:33:36,576 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:33:36,585 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:33:36,641 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:33:36,642 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:33:36,642 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:33:36,643 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:33:36,643 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:33:36,643 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:33:36,643 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:33:36,643 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:33:36,643 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:33:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 14:33:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 14:33:36,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:36,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 14:33:36,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:36,680 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 14:33:36,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:36,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:36,888 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:33:36,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:33:36,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 14:33:36,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:33:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:33:36,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:36,915 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 14:33:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:36,965 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:33:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:33:36,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 14:33:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:36,978 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:33:36,978 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 14:33:36,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:33:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 14:33:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 14:33:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 14:33:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 14:33:37,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 14:33:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:37,013 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 14:33:37,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:33:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 14:33:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:33:37,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:37,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:33:37,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:37,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 14:33:37,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:37,140 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:33:37,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:37,140 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:33:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:37,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:37,279 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:33:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-04 14:33:37,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:33:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:33:37,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:37,314 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-04 14:33:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:37,364 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 14:33:37,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:33:37,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 14:33:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:37,367 INFO L225 Difference]: With dead ends: 6 [2018-10-04 14:33:37,367 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 14:33:37,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:33:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 14:33:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 14:33:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 14:33:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 14:33:37,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 14:33:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:37,374 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 14:33:37,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:33:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 14:33:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:33:37,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:37,375 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 14:33:37,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:37,376 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 14:33:37,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:37,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:37,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 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:33:37,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:37,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:37,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:37,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:37,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:33:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:33:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:33:37,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:37,552 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-04 14:33:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:37,596 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 14:33:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:33:37,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 14:33:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:37,597 INFO L225 Difference]: With dead ends: 7 [2018-10-04 14:33:37,597 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 14:33:37,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:33:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 14:33:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 14:33:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:33:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 14:33:37,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 14:33:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:37,601 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 14:33:37,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:33:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 14:33:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:33:37,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:37,602 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 14:33:37,602 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:37,602 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 14:33:37,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:37,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:37,717 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:33:37,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:37,719 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:33:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:37,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:33:37,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:37,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:37,811 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:33:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:33:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:33:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:33:37,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:37,837 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-04 14:33:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:37,926 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 14:33:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:33:37,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 14:33:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:37,927 INFO L225 Difference]: With dead ends: 8 [2018-10-04 14:33:37,927 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:33:37,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:33:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:33:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:33:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:33:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:33:37,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 14:33:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:37,931 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:33:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:33:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:33:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:33:37,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:37,932 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 14:33:37,932 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:37,933 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 14:33:37,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:37,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:38,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:38,172 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:33:38,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:38,188 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:38,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:38,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:38,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:38,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:33:38,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:33:38,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:33:38,245 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:38,246 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-04 14:33:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:38,315 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:33:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:33:38,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 14:33:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:38,317 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:33:38,317 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:33:38,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 14:33:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:33:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:33:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:33:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 14:33:38,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 14:33:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:38,322 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 14:33:38,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:33:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 14:33:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:33:38,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:38,323 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 14:33:38,324 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:38,324 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 14:33:38,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:38,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:38,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:38,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:38,553 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:33:38,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:38,554 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:33:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:38,576 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:33:38,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:38,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:38,658 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:33:38,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:38,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:33:38,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:33:38,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:33:38,679 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:38,679 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-04 14:33:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:38,737 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 14:33:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:33:38,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 14:33:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:38,739 INFO L225 Difference]: With dead ends: 10 [2018-10-04 14:33:38,739 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:33:38,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 6 [2018-10-04 14:33:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:33:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:33:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:33:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:33:38,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 14:33:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:38,744 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:33:38,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:33:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:33:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:33:38,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:38,745 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 14:33:38,745 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:38,745 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 14:33:38,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:38,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:38,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:38,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:38,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:38,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:38,914 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:33:38,926 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:38,937 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:33:38,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:38,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:39,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:33:39,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:33:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:33:39,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:39,006 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-04 14:33:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:39,129 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:33:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:33:39,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-04 14:33:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:39,130 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:33:39,130 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:33:39,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:33:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:33:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:33:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:33:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:33:39,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 14:33:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:39,136 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:33:39,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:33:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:33:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:33:39,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:39,137 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 14:33:39,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:39,137 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 14:33:39,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:39,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:39,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:39,693 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:33:39,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:39,694 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:33:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:39,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:39,751 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:33:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:39,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:33:39,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:33:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:33:39,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:39,773 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-04 14:33:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:39,852 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 14:33:39,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:33:39,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-04 14:33:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:39,854 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:33:39,854 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:33:39,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 8 [2018-10-04 14:33:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:33:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:33:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:33:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:33:39,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 14:33:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:39,858 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:33:39,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:33:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:33:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:33:39,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:39,859 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 14:33:39,859 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:39,859 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 14:33:39,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:39,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:39,992 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:33:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:40,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:40,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:40,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:40,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:40,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:33:40,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:33:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:33:40,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:40,061 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-04 14:33:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:40,189 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:33:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:33:40,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-04 14:33:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:40,190 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:33:40,191 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:33:40,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:33:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:33:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:33:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:33:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 14:33:40,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 14:33:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:40,196 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 14:33:40,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:33:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 14:33:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:33:40,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:40,197 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 14:33:40,197 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:40,197 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 14:33:40,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:40,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:40,377 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:33:40,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:40,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:40,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:33:40,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:40,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:40,455 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:33:40,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:40,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:33:40,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:33:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:33:40,478 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:40,478 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-04 14:33:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:40,600 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 14:33:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:33:40,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 14:33:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:40,601 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:33:40,601 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:33:40,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 14:33:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:33:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:33:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:33:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 14:33:40,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 14:33:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:40,606 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 14:33:40,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:33:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 14:33:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:33:40,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:40,607 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 14:33:40,608 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:40,608 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 14:33:40,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:40,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:40,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:40,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:40,873 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:33:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:40,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:40,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:40,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:40,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:33:40,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:33:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:33:40,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:40,964 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-04 14:33:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:41,104 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 14:33:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:33:41,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 14:33:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:41,105 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:33:41,105 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:33:41,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:33:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:33:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:33:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:33:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 14:33:41,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 14:33:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:41,109 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 14:33:41,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:33:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 14:33:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:33:41,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:41,110 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 14:33:41,110 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:41,110 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 14:33:41,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:41,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:41,477 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:33:41,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:41,478 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:33:41,489 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:41,520 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:33:41,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:41,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:41,558 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:33:41,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:41,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:33:41,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:33:41,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:33:41,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:41,580 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-04 14:33:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:41,703 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 14:33:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:33:41,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:33:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:41,705 INFO L225 Difference]: With dead ends: 16 [2018-10-04 14:33:41,705 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:33:41,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 12 [2018-10-04 14:33:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:33:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:33:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:33:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:33:41,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 14:33:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:41,710 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:33:41,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:33:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:33:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:33:41,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:41,711 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 14:33:41,711 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:41,711 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 14:33:41,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:41,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:42,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:42,014 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:33:42,022 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:42,030 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:33:42,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:42,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:33:42,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:33:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:33:42,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:42,096 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-04 14:33:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:42,308 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:33:42,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:33:42,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 14:33:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:42,310 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:33:42,310 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:33:42,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 14:33:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:33:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:33:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:33:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 14:33:42,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 14:33:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:42,316 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 14:33:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:33:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 14:33:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:33:42,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:42,317 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 14:33:42,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:42,318 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 14:33:42,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:42,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:42,561 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:33:42,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:42,562 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:33:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:42,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:42,632 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:33:42,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:42,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:33:42,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:33:42,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:33:42,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:42,654 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-04 14:33:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:42,965 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 14:33:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:33:42,965 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 14:33:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:42,966 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:33:42,966 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:33:42,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 14:33:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:33:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:33:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:33:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 14:33:42,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 14:33:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:42,971 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 14:33:42,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:33:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 14:33:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:33:42,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:42,972 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 14:33:42,972 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:42,972 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 14:33:42,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:43,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:43,247 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:33:43,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:43,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:43,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:43,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:33:43,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:33:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:33:43,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:43,392 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-04 14:33:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:43,562 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 14:33:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:33:43,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:33:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:43,564 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:33:43,564 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:33:43,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 15 [2018-10-04 14:33:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:33:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 14:33:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:33:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 14:33:43,568 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 14:33:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:43,568 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 14:33:43,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:33:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 14:33:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:33:43,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:43,569 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 14:33:43,570 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:43,570 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 14:33:43,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:43,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:43,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:43,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:43,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:44,057 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:33:44,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:44,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 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:33:44,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:44,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:33:44,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:44,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:44,177 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:33:44,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:44,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:33:44,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:33:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:33:44,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:44,201 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-04 14:33:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:44,450 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 14:33:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:33:44,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-04 14:33:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:44,451 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:33:44,451 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:33:44,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 16 [2018-10-04 14:33:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:33:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:33:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:33:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:33:44,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 14:33:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:33:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:33:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:33:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:33:44,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:44,457 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 14:33:44,457 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:44,457 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 14:33:44,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:44,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:44,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:44,887 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:33:44,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:44,902 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:44,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:44,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:45,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:45,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:33:45,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:33:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:33:45,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:45,273 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-04 14:33:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:45,527 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:33:45,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:33:45,528 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 14:33:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:45,529 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:33:45,529 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:33:45,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 17 [2018-10-04 14:33:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:33:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:33:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:33:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 14:33:45,533 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 14:33:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:45,534 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 14:33:45,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:33:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 14:33:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:33:45,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:45,535 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 14:33:45,535 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:45,535 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 14:33:45,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:45,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:46,336 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:33:46,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:46,337 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:33:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:46,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 14:33:46,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:46,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:46,540 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:33:46,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:46,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:33:46,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:33:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:33:46,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:46,561 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-04 14:33:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:46,822 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 14:33:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:33:46,822 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-04 14:33:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:46,823 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:33:46,823 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:33:46,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 18 [2018-10-04 14:33:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:33:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:33:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:33:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 14:33:46,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 14:33:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:46,829 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 14:33:46,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:33:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 14:33:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:33:46,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:46,829 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 14:33:46,830 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:46,830 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 14:33:46,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:46,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:46,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:47,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:47,269 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:33:47,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:47,289 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:33:47,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:47,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:33:47,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:33:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:33:47,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:47,363 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-04 14:33:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:47,684 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 14:33:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:33:47,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-04 14:33:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:47,685 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:33:47,686 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:33:47,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 19 [2018-10-04 14:33:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:33:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:33:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:33:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 14:33:47,691 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 14:33:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:47,691 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 14:33:47,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:33:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 14:33:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:33:47,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:47,692 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 14:33:47,692 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:47,692 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 14:33:47,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:47,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:48,181 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:33:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:48,181 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:33:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:48,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:48,278 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:33:48,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:48,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:33:48,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:33:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:33:48,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:48,308 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-04 14:33:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:48,659 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 14:33:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:33:48,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-04 14:33:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:48,661 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:33:48,661 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:33:48,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 20 [2018-10-04 14:33:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:33:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:33:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:33:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:33:48,666 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 14:33:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:48,667 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:33:48,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:33:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:33:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:33:48,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:48,668 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 14:33:48,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:48,668 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 14:33:48,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:48,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:48,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:48,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:48,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:49,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:49,023 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:33:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:49,058 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:49,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:49,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:49,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:49,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:33:49,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:33:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:33:49,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:49,157 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-04 14:33:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:49,486 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:33:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:33:49,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-04 14:33:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:49,487 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:33:49,488 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:33:49,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 21 [2018-10-04 14:33:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:33:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:33:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:33:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 14:33:49,493 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 14:33:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:49,493 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 14:33:49,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:33:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 14:33:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:33:49,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:49,494 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 14:33:49,494 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:49,495 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 14:33:49,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:49,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:49,925 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:33:49,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:49,926 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:49,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:33:49,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:49,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:50,076 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:33:50,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:50,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:33:50,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:33:50,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:33:50,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:50,103 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-04 14:33:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:50,506 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 14:33:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:33:50,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-04 14:33:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:50,508 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:33:50,508 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:33:50,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 14:33:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:33:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:33:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:33:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 14:33:50,513 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 14:33:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:50,513 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 14:33:50,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:33:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 14:33:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:33:50,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:50,514 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 14:33:50,514 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:50,514 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 14:33:50,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:50,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:51,112 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:33:51,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:51,126 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:51,127 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:51,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:51,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:51,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:33:51,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:33:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:33:51,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:51,211 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-04 14:33:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:51,612 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 14:33:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:33:51,613 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-04 14:33:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:51,614 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:33:51,614 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:33:51,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 23 [2018-10-04 14:33:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:33:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:33:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:33:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 14:33:51,619 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 14:33:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:51,620 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 14:33:51,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:33:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 14:33:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:33:51,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:51,621 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 14:33:51,621 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:51,621 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 14:33:51,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:51,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:51,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:52,100 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:33:52,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:52,100 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:33:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:52,119 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 14:33:52,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:52,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:52,166 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:33:52,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:52,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:33:52,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:33:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:33:52,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:52,189 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-04 14:33:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:53,029 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 14:33:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:33:53,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-04 14:33:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:53,030 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:33:53,030 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:33:53,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 24 [2018-10-04 14:33:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:33:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:33:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:33:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:33:53,033 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 14:33:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:53,034 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:33:53,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:33:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:33:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:33:53,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:53,035 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 14:33:53,035 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:53,035 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:53,035 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 14:33:53,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:53,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:53,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:53,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:53,579 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:33:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:53,601 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:33:53,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:53,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:53,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:53,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:33:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:33:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:33:53,716 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:53,717 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-04 14:33:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:54,186 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:33:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:33:54,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-04 14:33:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:54,187 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:33:54,187 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:33:54,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 25 [2018-10-04 14:33:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:33:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 14:33:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:33:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 14:33:54,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 14:33:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:54,193 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 14:33:54,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:33:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 14:33:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 14:33:54,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:54,194 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 14:33:54,194 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:54,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:54,194 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 14:33:54,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:54,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:54,731 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:33:54,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:54,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 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:33:54,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:54,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:54,821 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:33:54,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:54,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:33:54,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:33:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:33:54,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:54,841 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-04 14:33:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:55,305 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 14:33:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:33:55,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-04 14:33:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:55,307 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:33:55,307 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:33:55,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 26 [2018-10-04 14:33:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:33:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:33:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:33:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 14:33:55,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 14:33:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:55,313 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 14:33:55,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:33:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 14:33:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:33:55,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:55,314 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 14:33:55,314 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:55,315 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 14:33:55,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:55,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:55,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:55,914 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:33:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:55,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:55,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:55,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:56,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:56,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:33:56,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:33:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:33:56,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:56,015 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-04 14:33:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:56,488 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 14:33:56,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:33:56,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-04 14:33:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:56,489 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:33:56,490 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:33:56,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 27 [2018-10-04 14:33:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:33:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 14:33:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:33:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 14:33:56,495 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 14:33:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:56,495 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 14:33:56,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:33:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 14:33:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:33:56,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:56,496 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 14:33:56,496 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:56,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 14:33:56,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:56,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:56,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:56,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:57,044 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:33:57,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:57,044 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:33:57,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:57,078 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:33:57,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:57,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:57,155 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:33:57,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:57,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:33:57,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:33:57,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:33:57,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:57,176 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-04 14:33:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:57,686 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 14:33:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:33:57,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-04 14:33:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:57,687 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:33:57,687 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:33:57,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 28 [2018-10-04 14:33:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:33:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:33:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:33:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:33:57,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 14:33:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:57,693 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:33:57,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:33:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:33:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:33:57,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:57,694 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 14:33:57,694 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:57,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 14:33:57,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:57,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:59,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:59,160 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:33:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:59,181 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:59,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:59,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:59,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:59,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:33:59,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:33:59,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:33:59,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:59,316 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-04 14:33:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:59,860 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:33:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:33:59,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-04 14:33:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:59,861 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:33:59,861 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:33:59,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 29 [2018-10-04 14:33:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:33:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 14:33:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:33:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 14:33:59,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 14:33:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:59,868 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 14:33:59,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:33:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 14:33:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:33:59,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:59,869 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 14:33:59,869 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:59,869 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 14:33:59,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:59,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:00,493 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:34:00,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:00,493 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:34:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:00,520 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 14:34:00,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:00,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:00,595 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:34:00,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:00,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:34:00,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:34:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:34:00,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:00,616 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-04 14:34:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:01,200 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 14:34:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:34:01,200 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-04 14:34:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:01,201 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:34:01,201 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:34:01,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.5s impTime 30 [2018-10-04 14:34:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:34:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 14:34:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 14:34:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 14:34:01,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 14:34:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:01,207 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 14:34:01,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:34:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 14:34:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:34:01,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:01,208 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 14:34:01,208 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:01,208 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:01,208 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 14:34:01,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:01,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:01,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:01,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:01,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:01,930 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:34:01,939 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:01,954 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:34:01,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:01,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:02,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:02,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:34:02,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:34:02,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:34:02,102 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:02,103 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-04 14:34:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:02,759 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 14:34:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:34:02,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-04 14:34:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:02,760 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:34:02,761 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:34:02,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 31 [2018-10-04 14:34:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:34:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:34:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:34:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 14:34:02,765 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 14:34:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:02,765 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 14:34:02,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:34:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 14:34:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:34:02,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:02,766 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 14:34:02,766 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:02,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 14:34:02,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:02,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:02,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:02,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:02,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:03,698 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:34:03,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:03,699 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:34:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:03,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:03,810 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:34:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:34:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:34:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:34:03,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:03,832 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-04 14:34:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:04,490 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 14:34:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:34:04,491 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-04 14:34:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:04,491 INFO L225 Difference]: With dead ends: 36 [2018-10-04 14:34:04,492 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:34:04,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.8s impTime 32 [2018-10-04 14:34:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:34:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:34:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:34:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:34:04,498 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 14:34:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:04,498 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:34:04,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:34:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:34:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:34:04,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:04,499 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 14:34:04,499 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:04,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:04,499 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 14:34:04,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:04,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:04,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:04,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:04,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:05,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:05,241 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:34:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:05,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:05,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:05,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:05,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:34:05,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:34:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:34:05,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:05,374 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-04 14:34:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:06,070 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:34:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:34:06,071 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-04 14:34:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:06,072 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:34:06,072 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:34:06,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.6s impTime 33 [2018-10-04 14:34:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:34:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 14:34:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:34:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 14:34:06,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 14:34:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:06,078 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 14:34:06,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:34:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 14:34:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 14:34:06,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:06,078 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 14:34:06,079 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:06,079 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 14:34:06,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:06,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:06,875 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:34:06,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:06,876 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:34:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:06,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:34:06,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:06,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:07,063 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:34:07,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:07,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:34:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:34:07,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:34:07,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:07,084 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-04 14:34:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:07,821 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 14:34:07,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:34:07,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-04 14:34:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:07,823 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:34:07,823 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:34:07,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 34 [2018-10-04 14:34:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:34:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:34:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:34:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 14:34:07,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 14:34:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:07,828 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 14:34:07,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:34:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 14:34:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:34:07,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:07,828 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 14:34:07,829 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:07,829 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 14:34:07,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:07,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:08,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:08,839 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:34:08,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:08,865 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:08,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:08,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:09,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:34:09,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:34:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:34:09,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:09,077 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-04 14:34:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:09,874 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 14:34:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:34:09,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-04 14:34:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:09,875 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:34:09,875 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 14:34:09,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 35 [2018-10-04 14:34:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 14:34:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 14:34:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:34:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 14:34:09,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 14:34:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:09,879 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 14:34:09,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:34:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 14:34:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:34:09,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:09,880 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 14:34:09,880 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:09,880 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 14:34:09,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:09,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:10,794 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:34:10,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:10,794 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:34:10,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:10,818 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 14:34:10,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:10,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:10,903 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:34:10,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:10,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:34:10,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:34:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:34:10,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:10,923 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-04 14:34:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:11,749 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 14:34:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:34:11,749 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-04 14:34:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:11,750 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:34:11,750 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:34:11,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 36 [2018-10-04 14:34:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:34:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:34:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:34:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:34:11,755 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 14:34:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:34:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:34:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:34:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:34:11,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:11,756 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 14:34:11,757 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:11,757 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 14:34:11,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:11,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:11,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:12,689 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:34:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:12,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:34:12,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:12,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:12,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:12,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:34:12,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:34:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:34:12,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:12,816 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-04 14:34:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:13,870 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:34:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:34:13,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-04 14:34:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:13,871 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:34:13,871 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:34:13,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 37 [2018-10-04 14:34:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:34:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:34:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:34:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 14:34:13,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 14:34:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:13,875 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 14:34:13,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:34:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 14:34:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:34:13,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:13,876 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 14:34:13,876 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:13,877 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 14:34:13,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:13,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:13,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:15,013 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:34:15,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:15,013 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:34:15,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:15,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:15,139 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:34:15,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:15,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:34:15,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:34:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:34:15,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:15,160 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-04 14:34:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:16,126 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 14:34:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:34:16,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-04 14:34:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:16,128 INFO L225 Difference]: With dead ends: 42 [2018-10-04 14:34:16,128 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:34:16,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 38 [2018-10-04 14:34:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:34:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:34:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:34:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 14:34:16,132 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 14:34:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:16,133 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 14:34:16,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:34:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 14:34:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:34:16,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:16,133 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 14:34:16,133 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:16,133 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 14:34:16,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:16,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:16,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:17,839 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:34:17,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:17,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:17,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:17,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:17,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:17,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:34:17,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:34:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:34:17,997 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:17,997 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-04 14:34:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:19,136 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 14:34:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:34:19,136 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-04 14:34:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:19,137 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:34:19,137 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 14:34:19,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 39 [2018-10-04 14:34:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 14:34:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 14:34:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 14:34:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 14:34:19,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 14:34:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:19,141 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 14:34:19,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:34:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 14:34:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:34:19,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:19,142 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 14:34:19,142 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:19,142 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 14:34:19,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:19,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:19,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:20,743 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:34:20,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:20,743 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:20,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:20,770 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:34:20,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:20,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:20,876 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:34:20,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:20,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:34:20,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:34:20,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:34:20,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:20,897 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-04 14:34:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:21,904 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 14:34:21,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:34:21,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-04 14:34:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:21,905 INFO L225 Difference]: With dead ends: 44 [2018-10-04 14:34:21,905 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:34:21,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 40 [2018-10-04 14:34:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:34:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:34:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:34:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:34:21,909 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 14:34:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:21,910 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:34:21,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:34:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:34:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:34:21,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:21,910 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 14:34:21,911 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:21,911 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 14:34:21,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:21,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:22,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:22,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:22,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:22,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:22,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:23,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:23,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:34:23,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:34:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:34:23,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:23,133 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-04 14:34:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:24,404 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:34:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:34:24,405 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-04 14:34:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:24,406 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:34:24,406 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:34:24,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 41 [2018-10-04 14:34:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:34:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 14:34:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:34:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 14:34:24,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 14:34:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:24,410 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 14:34:24,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:34:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 14:34:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:34:24,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:24,411 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 14:34:24,411 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:24,411 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 14:34:24,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:24,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:24,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:26,684 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:34:26,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:26,685 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:34:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:26,714 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 14:34:26,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:26,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:26,798 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:34:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:26,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:34:26,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:34:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:34:26,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:26,818 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-04 14:34:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:27,928 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 14:34:27,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:34:27,928 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-04 14:34:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:27,929 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:34:27,929 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:34:27,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.8s impTime 42 [2018-10-04 14:34:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:34:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 14:34:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:34:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 14:34:27,933 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 14:34:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:27,933 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 14:34:27,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:34:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 14:34:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:34:27,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:27,934 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 14:34:27,934 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:27,934 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 14:34:27,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:29,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:29,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 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:34:29,401 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:29,423 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 14:34:29,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:29,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:29,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:29,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:34:29,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:34:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:34:29,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:29,554 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-04 14:34:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:30,721 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 14:34:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:34:30,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-04 14:34:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:30,723 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:34:30,723 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 14:34:30,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 43 [2018-10-04 14:34:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 14:34:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 14:34:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 14:34:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 14:34:30,727 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 14:34:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:30,727 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 14:34:30,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:34:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 14:34:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:34:30,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:30,728 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 14:34:30,728 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:30,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 14:34:30,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:32,091 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:34:32,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:32,091 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:34:32,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:32,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:32,208 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:34:32,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:32,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:34:32,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:34:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:34:32,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:32,228 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-04 14:34:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:33,461 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 14:34:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:34:33,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-04 14:34:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:33,463 INFO L225 Difference]: With dead ends: 48 [2018-10-04 14:34:33,463 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:34:33,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 44 [2018-10-04 14:34:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:34:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:34:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:34:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 14:34:33,467 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 14:34:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:33,467 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 14:34:33,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:34:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 14:34:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:34:33,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:33,468 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-04 14:34:33,468 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:33,468 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-04 14:34:33,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:33,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:35,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:35,116 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:35,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:35,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:34:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:34:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:34:35,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:35,297 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-04 14:34:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:36,577 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 14:34:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:34:36,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-04 14:34:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:36,578 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:34:36,579 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 14:34:36,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 45 [2018-10-04 14:34:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 14:34:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 14:34:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 14:34:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 14:34:36,583 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 14:34:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:36,583 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 14:34:36,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:34:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 14:34:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 14:34:36,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:36,584 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-04 14:34:36,584 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:36,584 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-04 14:34:36,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:37,912 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:34:37,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:37,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 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:34:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:37,942 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 14:34:37,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:37,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:38,042 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:34:38,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:38,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:34:38,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:34:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:34:38,063 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:38,063 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-04 14:34:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:39,518 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 14:34:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:34:39,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-04 14:34:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:39,519 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:34:39,519 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:34:39,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime 46 [2018-10-04 14:34:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:34:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 14:34:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 14:34:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 14:34:39,524 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 14:34:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:39,524 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 14:34:39,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:34:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 14:34:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:34:39,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:39,525 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-04 14:34:39,525 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:39,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-04 14:34:39,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:39,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:39,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:40,950 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:34:40,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:40,975 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:40,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:40,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:41,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:41,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:34:41,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:34:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:34:41,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:41,094 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-04 14:34:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:42,488 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 14:34:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:34:42,489 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-04 14:34:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:42,489 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:34:42,490 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 14:34:42,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.2s impTime 47 [2018-10-04 14:34:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 14:34:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 14:34:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:34:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 14:34:42,494 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 14:34:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:42,494 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 14:34:42,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:34:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 14:34:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 14:34:42,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:42,495 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-04 14:34:42,495 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:42,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-04 14:34:42,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:42,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:43,954 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:34:43,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:43,955 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:34:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:43,983 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:34:43,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:43,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:44,125 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:34:44,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:44,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:34:44,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:34:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:34:44,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:44,157 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-04 14:34:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:45,771 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 14:34:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:34:45,772 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-04 14:34:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:45,773 INFO L225 Difference]: With dead ends: 52 [2018-10-04 14:34:45,773 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:34:45,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 48 [2018-10-04 14:34:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:34:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:34:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:34:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 14:34:45,778 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 14:34:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:45,778 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 14:34:45,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:34:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 14:34:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:34:45,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:45,779 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-04 14:34:45,779 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:45,779 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-04 14:34:45,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:45,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:47,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:47,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:47,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:47,288 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:34:47,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:47,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:47,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:47,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:34:47,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:34:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:34:47,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:47,433 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-04 14:34:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:48,966 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 14:34:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:34:48,967 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-04 14:34:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:48,968 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:34:48,968 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 14:34:48,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 49 [2018-10-04 14:34:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 14:34:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 14:34:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:34:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 14:34:48,973 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 14:34:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:48,973 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 14:34:48,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:34:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 14:34:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 14:34:48,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:48,974 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-04 14:34:48,974 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:48,974 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-04 14:34:48,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:48,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:50,724 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:34:50,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:50,724 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:34:50,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:50,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:50,840 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:34:50,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:34:50,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:34:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:34:50,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:50,860 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-04 14:34:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:52,431 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 14:34:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:34:52,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-04 14:34:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:52,433 INFO L225 Difference]: With dead ends: 54 [2018-10-04 14:34:52,433 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:34:52,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 50 [2018-10-04 14:34:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:34:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 14:34:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 14:34:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 14:34:52,437 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 14:34:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:52,437 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 14:34:52,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:34:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 14:34:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:34:52,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:52,437 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-04 14:34:52,438 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:52,438 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-04 14:34:52,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:52,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:54,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:54,759 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:34:54,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:54,785 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:54,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:54,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:34:54,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:34:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:34:54,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:54,902 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-04 14:34:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:56,534 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 14:34:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:34:56,535 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-04 14:34:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:56,536 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:34:56,536 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 14:34:56,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime 51 [2018-10-04 14:34:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 14:34:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 14:34:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 14:34:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 14:34:56,539 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 14:34:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:56,540 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 14:34:56,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:34:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 14:34:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:34:56,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:56,540 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-04 14:34:56,541 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:56,541 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-04 14:34:56,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:56,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,345 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:34:58,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:58,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 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:34:58,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:58,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 14:34:58,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:58,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:58,511 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:34:58,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:58,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:34:58,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:34:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:34:58,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:58,532 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-04 14:35:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:00,417 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 14:35:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:35:00,417 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-04 14:35:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:00,418 INFO L225 Difference]: With dead ends: 56 [2018-10-04 14:35:00,418 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:35:00,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.5s impTime 52 [2018-10-04 14:35:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:35:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:35:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:35:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 14:35:00,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 14:35:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:00,422 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 14:35:00,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:35:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 14:35:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:35:00,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:00,423 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-04 14:35:00,423 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:00,423 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-04 14:35:00,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:00,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:02,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 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:02,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:02,163 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:02,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:02,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:02,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:35:02,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:35:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:35:02,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:02,289 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-04 14:35:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:04,049 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 14:35:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:35:04,050 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-04 14:35:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:04,050 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:35:04,051 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 14:35:04,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 53 [2018-10-04 14:35:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 14:35:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 14:35:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 14:35:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 14:35:04,054 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 14:35:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:04,054 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 14:35:04,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:35:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 14:35:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 14:35:04,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:04,055 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-04 14:35:04,055 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:04,055 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-04 14:35:04,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:04,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:04,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:04,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:06,153 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:06,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:06,154 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:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:06,191 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 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,305 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:06,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:06,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:35:06,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:35:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:35:06,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:06,325 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-04 14:35:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:08,148 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 14:35:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:35:08,148 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-04 14:35:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:08,149 INFO L225 Difference]: With dead ends: 58 [2018-10-04 14:35:08,149 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:35:08,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.9s impTime 54 [2018-10-04 14:35:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:35:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 14:35:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:35:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 14:35:08,154 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 14:35:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:08,154 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 14:35:08,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:35:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 14:35:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 14:35:08,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:08,155 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-04 14:35:08,155 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:08,155 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-04 14:35:08,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:10,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:10,207 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:35:10,214 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:10,245 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 14:35:10,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:10,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:10,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:10,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:35:10,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:35:10,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:35:10,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:10,375 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-04 14:35:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:12,303 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 14:35:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:35:12,304 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-04 14:35:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:12,305 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:35:12,305 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 14:35:12,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.8s impTime 55 [2018-10-04 14:35:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 14:35:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 14:35:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 14:35:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 14:35:12,309 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 14:35:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:12,309 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 14:35:12,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:35:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 14:35:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:35:12,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:12,310 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-04 14:35:12,310 INFO L423 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:12,310 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-04 14:35:12,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:12,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:14,809 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:14,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:14,809 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:35:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:14,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:15,007 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:15,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:15,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:35:15,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:35:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:35:15,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:15,029 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-04 14:35:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,122 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 14:35:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:35:17,122 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-04 14:35:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,123 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:35:17,123 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:35:17,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.1s impTime 56 [2018-10-04 14:35:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:35:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:35:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:35:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 14:35:17,127 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 14:35:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,128 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 14:35:17,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:35:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 14:35:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:35:17,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,128 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-04 14:35:17,128 INFO L423 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,128 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-04 14:35:17,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:19,195 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:35:19,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:19,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:19,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:19,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:35:19,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:35:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:35:19,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:19,362 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-04 14:35:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,610 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 14:35:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:35:21,610 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-04 14:35:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,611 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:35:21,611 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 14:35:21,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.8s impTime 57 [2018-10-04 14:35:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 14:35:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 14:35:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 14:35:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 14:35:21,615 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 14:35:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,615 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 14:35:21,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:35:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 14:35:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 14:35:21,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,616 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-04 14:35:21,616 INFO L423 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,617 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-04 14:35:21,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,676 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:23,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,676 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:35:23,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:23,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 14:35:23,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:23,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,145 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:24,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:35:24,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:35:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:35:24,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,182 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-04 14:35:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,403 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 14:35:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:35:27,403 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-04 14:35:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,404 INFO L225 Difference]: With dead ends: 62 [2018-10-04 14:35:27,404 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:35:27,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.8s impTime 58 [2018-10-04 14:35:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:35:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 14:35:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 14:35:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 14:35:27,409 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 14:35:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,410 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 14:35:27,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:35:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 14:35:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 14:35:27,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,410 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-04 14:35:27,411 INFO L423 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,411 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-04 14:35:27,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:29,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:29,693 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:29,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:29,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:35:29,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:35:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:35:29,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,849 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-04 14:35:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,168 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 14:35:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:35:32,169 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-04 14:35:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,169 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:35:32,170 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 14:35:32,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime 59 [2018-10-04 14:35:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 14:35:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 14:35:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 14:35:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 14:35:32,174 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 14:35:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,175 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 14:35:32,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:35:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 14:35:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 14:35:32,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,175 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-04 14:35:32,175 INFO L423 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,176 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-04 14:35:32,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,381 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:34,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:34,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:34,421 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 14:35:34,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:34,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,560 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:34,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:35:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:35:34,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:35:34,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,580 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-04 14:35:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,008 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 14:35:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:35:37,008 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-04 14:35:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,009 INFO L225 Difference]: With dead ends: 64 [2018-10-04 14:35:37,009 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:35:37,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 2.0s impTime 60 [2018-10-04 14:35:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:35:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:35:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:35:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 14:35:37,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 14:35:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:37,013 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 14:35:37,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:35:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 14:35:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:35:37,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:37,014 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-04 14:35:37,014 INFO L423 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:37,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-04 14:35:37,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:39,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,284 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:35:39,291 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:39,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:35:39,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:39,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:35:39,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:35:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:35:39,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,462 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-04 14:35:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:41,945 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 14:35:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:35:41,945 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-04 14:35:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:41,946 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:35:41,946 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 14:35:41,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime 61 [2018-10-04 14:35:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 14:35:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 14:35:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:35:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 14:35:41,950 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 14:35:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:41,950 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 14:35:41,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:35:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 14:35:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:35:41,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:41,951 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-04 14:35:41,951 INFO L423 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:41,951 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-04 14:35:41,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:41,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:41,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:41,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:44,251 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:44,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:44,251 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:35:44,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:44,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:44,412 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:44,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:44,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:35:44,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:35:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:35:44,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:44,432 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-04 14:35:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:47,040 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 14:35:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:35:47,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-04 14:35:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:47,041 INFO L225 Difference]: With dead ends: 66 [2018-10-04 14:35:47,041 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 14:35:47,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.1s impTime 62 [2018-10-04 14:35:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 14:35:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 14:35:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 14:35:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 14:35:47,045 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 14:35:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:47,045 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 14:35:47,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:35:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 14:35:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 14:35:47,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:47,045 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-04 14:35:47,046 INFO L423 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:47,046 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-04 14:35:47,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:49,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:49,460 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:35:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:49,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:49,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:49,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:49,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:49,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:35:49,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:35:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:35:49,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:49,651 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-04 14:35:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:52,334 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 14:35:52,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:35:52,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-04 14:35:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:52,336 INFO L225 Difference]: With dead ends: 67 [2018-10-04 14:35:52,336 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 14:35:52,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.2s impTime 63 [2018-10-04 14:35:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 14:35:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 14:35:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 14:35:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 14:35:52,341 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 14:35:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:52,341 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 14:35:52,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:35:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 14:35:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 14:35:52,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:52,342 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-04 14:35:52,342 INFO L423 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:52,343 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-04 14:35:52,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:54,936 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:54,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:54,937 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:35:54,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:54,980 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 14:35:54,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:54,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:55,348 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:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:35:55,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:35:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:35:55,368 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:55,368 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-04 14:35:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:58,113 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 14:35:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:35:58,114 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-04 14:35:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:58,115 INFO L225 Difference]: With dead ends: 68 [2018-10-04 14:35:58,115 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:35:58,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.3s impTime 64 [2018-10-04 14:35:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:35:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:35:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:35:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 14:35:58,120 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 14:35:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:58,120 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 14:35:58,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:35:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 14:35:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:35:58,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:58,121 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-04 14:35:58,121 INFO L423 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:58,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-04 14:35:58,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:58,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:58,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:58,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:00,622 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:00,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:00,648 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:00,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:00,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:00,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:36:00,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:36:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:36:00,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:00,829 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-04 14:36:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,660 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 14:36:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:36:03,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-04 14:36:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,661 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:36:03,661 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 14:36:03,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.3s impTime 65 [2018-10-04 14:36:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 14:36:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 14:36:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 14:36:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 14:36:03,666 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 14:36:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 14:36:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:36:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 14:36:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:36:03,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:03,666 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-04 14:36:03,667 INFO L423 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:03,667 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-04 14:36:03,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:06,636 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:36:06,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:06,636 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:06,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:06,675 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 14:36:06,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:06,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:06,812 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:36:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:36:06,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:36:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:36:06,833 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:06,833 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-04 14:36:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:09,580 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 14:36:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:36:09,580 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-04 14:36:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:09,581 INFO L225 Difference]: With dead ends: 70 [2018-10-04 14:36:09,581 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:36:09,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.6s impTime 66 [2018-10-04 14:36:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:36:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 14:36:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 14:36:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 14:36:09,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 14:36:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:09,586 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 14:36:09,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:36:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 14:36:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 14:36:09,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:09,587 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-04 14:36:09,587 INFO L423 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:09,587 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-04 14:36:09,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:09,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:09,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:09,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:12,593 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:12,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:12,634 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 14:36:12,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:12,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:12,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:36:12,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:36:12,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:36:12,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:12,808 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-04 14:36:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:15,579 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 14:36:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:36:15,580 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-04 14:36:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:15,581 INFO L225 Difference]: With dead ends: 71 [2018-10-04 14:36:15,581 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 14:36:15,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.7s impTime 67 [2018-10-04 14:36:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 14:36:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 14:36:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 14:36:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 14:36:15,586 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 14:36:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:15,587 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 14:36:15,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:36:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 14:36:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 14:36:15,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:15,587 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-04 14:36:15,588 INFO L423 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:15,588 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-04 14:36:15,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:15,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:15,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:15,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:18,588 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:36:18,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:18,588 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:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:18,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:18,764 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:36:18,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:18,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:36:18,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:36:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:36:18,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:18,785 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-04 14:36:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:21,857 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 14:36:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:36:21,857 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-04 14:36:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:21,858 INFO L225 Difference]: With dead ends: 72 [2018-10-04 14:36:21,858 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:36:21,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.7s impTime 68 [2018-10-04 14:36:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:36:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:36:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:36:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 14:36:21,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 14:36:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:21,862 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 14:36:21,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:36:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 14:36:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:36:21,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:21,862 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-04 14:36:21,863 INFO L423 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:21,863 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-04 14:36:21,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:24,700 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:24,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:24,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:24,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:24,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:36:24,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:36:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:36:24,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:24,883 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-04 14:36:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:28,019 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 14:36:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:36:28,019 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-04 14:36:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:28,020 INFO L225 Difference]: With dead ends: 73 [2018-10-04 14:36:28,020 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 14:36:28,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.6s impTime 69 [2018-10-04 14:36:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 14:36:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 14:36:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 14:36:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 14:36:28,024 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 14:36:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:28,024 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 14:36:28,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:36:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 14:36:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 14:36:28,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:28,025 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-04 14:36:28,025 INFO L423 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:28,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-04 14:36:28,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:30,933 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:36:30,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:30,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:30,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 14:36:30,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:30,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:31,123 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:36:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:36:31,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:36:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:36:31,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:31,143 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-04 14:36:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:34,387 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 14:36:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:36:34,388 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-04 14:36:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:34,389 INFO L225 Difference]: With dead ends: 74 [2018-10-04 14:36:34,389 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 14:36:34,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.7s impTime 70 [2018-10-04 14:36:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 14:36:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 14:36:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:36:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 14:36:34,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 14:36:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:34,394 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 14:36:34,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:36:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 14:36:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 14:36:34,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:34,395 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-04 14:36:34,395 INFO L423 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:34,395 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-04 14:36:34,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:37,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 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:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:37,628 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:37,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:37,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:36:37,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:36:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:36:37,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:37,806 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-04 14:36:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:41,367 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 14:36:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:36:41,367 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-04 14:36:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:41,368 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:36:41,368 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:36:41,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.9s impTime 71 [2018-10-04 14:36:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:36:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 14:36:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:36:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 14:36:41,374 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 14:36:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 14:36:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:36:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 14:36:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:36:41,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:41,375 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-04 14:36:41,375 INFO L423 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:41,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-04 14:36:41,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:45,021 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:36:45,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:45,022 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:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:45,438 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 14:36:45,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:45,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:45,790 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:36:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:36:45,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:36:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:36:45,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:45,811 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-04 14:36:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:49,591 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 14:36:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:36:49,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-04 14:36:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:49,592 INFO L225 Difference]: With dead ends: 76 [2018-10-04 14:36:49,592 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:36:49,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.2s impTime 72 [2018-10-04 14:36:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:36:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:36:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:36:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 14:36:49,598 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 14:36:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:49,598 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 14:36:49,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:36:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 14:36:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:36:49,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:49,599 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-04 14:36:49,599 INFO L423 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:49,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-04 14:36:49,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:49,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:53,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:53,793 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:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:53,857 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:36:53,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:54,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:36:54,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:36:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:36:54,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:54,315 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-04 14:36:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:57,777 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 14:36:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:36:57,778 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-04 14:36:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:57,779 INFO L225 Difference]: With dead ends: 77 [2018-10-04 14:36:57,779 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 14:36:57,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time 3.7s impTime 73 [2018-10-04 14:36:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 14:36:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 14:36:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:36:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 14:36:57,785 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 14:36:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:57,785 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 14:36:57,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:36:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 14:36:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 14:36:57,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:57,786 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-04 14:36:57,786 INFO L423 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:57,786 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-04 14:36:57,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:01,724 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:37:01,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:01,724 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:37:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:01,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:01,954 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:37:01,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 14:37:01,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:37:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:37:01,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:01,975 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-04 14:37:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:05,591 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 14:37:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:37:05,591 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-04 14:37:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:05,592 INFO L225 Difference]: With dead ends: 78 [2018-10-04 14:37:05,592 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 14:37:05,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 3.5s impTime 74 [2018-10-04 14:37:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 14:37:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 14:37:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 14:37:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 14:37:05,597 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 14:37:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:05,598 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 14:37:05,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:37:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 14:37:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 14:37:05,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:05,599 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-04 14:37:05,599 INFO L423 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:05,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-04 14:37:05,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:10,600 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:37:10,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:10,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:10,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:10,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:10,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:37:10,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:37:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:37:10,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:10,810 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-04 14:37:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:14,446 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 14:37:14,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:37:14,447 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-04 14:37:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:14,448 INFO L225 Difference]: With dead ends: 79 [2018-10-04 14:37:14,448 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 14:37:14,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time 4.4s impTime 75 [2018-10-04 14:37:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 14:37:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 14:37:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 14:37:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 14:37:14,452 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 14:37:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:14,453 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 14:37:14,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:37:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 14:37:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 14:37:14,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:14,453 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-04 14:37:14,453 INFO L423 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:14,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:14,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-04 14:37:14,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:14,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:17,917 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:37:17,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:17,918 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:37:17,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:17,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 14:37:17,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:17,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:18,219 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:37:18,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:18,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 14:37:18,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:37:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:37:18,240 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:18,240 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-04 14:37:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:21,818 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 14:37:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:37:21,818 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-04 14:37:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:21,819 INFO L225 Difference]: With dead ends: 80 [2018-10-04 14:37:21,819 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:37:21,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.2s impTime 76 [2018-10-04 14:37:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:37:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:37:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:37:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 14:37:21,823 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 14:37:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:21,823 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 14:37:21,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:37:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 14:37:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:37:21,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:21,824 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-04 14:37:21,824 INFO L423 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:21,824 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-04 14:37:21,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:21,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:21,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:26,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:26,178 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:37:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:26,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:26,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:26,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:37:26,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:37:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:37:26,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:26,396 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-04 14:37:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:30,251 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 14:37:30,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:37:30,252 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-04 14:37:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:30,253 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:37:30,253 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:37:30,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time 3.9s impTime 77 [2018-10-04 14:37:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:37:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:37:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:37:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 14:37:30,258 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 14:37:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:30,258 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 14:37:30,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:37:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 14:37:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 14:37:30,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:30,258 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-04 14:37:30,258 INFO L423 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:30,259 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-04 14:37:30,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:30,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:30,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:34,031 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:37:34,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:34,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 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:37:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:34,078 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 14:37:34,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:34,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:34,339 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:37:34,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:34,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 14:37:34,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:37:34,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:37:34,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:34,359 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-04 14:37:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:38,131 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 14:37:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:37:38,131 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-04 14:37:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:38,132 INFO L225 Difference]: With dead ends: 82 [2018-10-04 14:37:38,132 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 14:37:38,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.5s impTime 78 [2018-10-04 14:37:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 14:37:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 14:37:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 14:37:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 14:37:38,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 14:37:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 14:37:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:37:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 14:37:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 14:37:38,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:38,139 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-04 14:37:38,139 INFO L423 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:38,139 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-04 14:37:38,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:38,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 14:37:40,549 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:37:40,554 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:37:40,554 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:37:40 BoogieIcfgContainer [2018-10-04 14:37:40,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:37:40,555 INFO L168 Benchmark]: Toolchain (without parser) took 244292.68 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -52.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 413.8 MB). Peak memory consumption was 361.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:40,557 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:37:40,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.43 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:37:40,560 INFO L168 Benchmark]: Boogie Preprocessor took 19.18 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:37:40,560 INFO L168 Benchmark]: RCFGBuilder took 230.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:40,561 INFO L168 Benchmark]: TraceAbstraction took 243999.52 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -52.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 392.6 MB). Peak memory consumption was 340.2 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:40,564 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 39.43 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 19.18 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 230.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243999.52 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -52.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 392.6 MB). Peak memory consumption was 340.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 78, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 79 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 243.9s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 109.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 167403 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6161 GetRequests, 3003 SyntacticMatches, 77 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 123.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=78, 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.3s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 126.3s InterpolantComputationTime, 6316 NumberOfCodeBlocks, 6316 NumberOfCodeBlocksAsserted, 935 NumberOfCheckSat, 6161 ConstructedInterpolants, 0 QuantifiedInterpolants, 2257339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6391 ConjunctsInSsa, 6237 ConjunctsInUnsatCore, 155 InterpolantComputations, 1 PerfectInterpolantSequences, 0/158158 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/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-37-40-575.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-37-40-575.csv Completed graceful shutdown