java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:19:16,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:19:16,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:19:16,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:19:16,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:19:16,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:19:16,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:19:16,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:19:16,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:19:16,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:19:16,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:19:16,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:19:16,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:19:16,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:19:16,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:19:16,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:19:16,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:19:16,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:19:16,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:19:16,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:19:16,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:19:16,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:19:16,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:19:16,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:19:16,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:19:16,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:19:16,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:19:16,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:19:16,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:19:16,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:19:16,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:19:16,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:19:16,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:19:16,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:19:16,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:19:16,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:19:16,163 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:19:16,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:19:16,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:19:16,191 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:19:16,191 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:19:16,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:19:16,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:19:16,192 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:19:16,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:19:16,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:19:16,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:19:16,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:19:16,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:19:16,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:19:16,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:19:16,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:19:16,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:19:16,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:19:16,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:19:16,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:19:16,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:19:16,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:19:16,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:19:16,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:19:16,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:19:16,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:19:16,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:19:16,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:19:16,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:19:16,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:19:16,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:19:16,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:19:16,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:19:16,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:19:16,265 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:19:16,265 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:19:16,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-10-04 12:19:16,266 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-10-04 12:19:16,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:19:16,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:19:16,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:19:16,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:19:16,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:19:16,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:19:16,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:19:16,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:19:16,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:19:16,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... [2018-10-04 12:19:16,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:19:16,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:19:16,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:19:16,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:19:16,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:19:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:19:16,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:19:16,749 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:19:16,749 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:19:16 BoogieIcfgContainer [2018-10-04 12:19:16,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:19:16,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:19:16,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:19:16,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:19:16,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:16" (1/2) ... [2018-10-04 12:19:16,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36455b75 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:19:16, skipping insertion in model container [2018-10-04 12:19:16,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:19:16" (2/2) ... [2018-10-04 12:19:16,757 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-10-04 12:19:16,767 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:19:16,775 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:19:16,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:19:16,820 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:19:16,821 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:19:16,821 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:19:16,821 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:19:16,821 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:19:16,821 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:19:16,822 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:19:16,822 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:19:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 12:19:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:19:16,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:16,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 12:19:16,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:16,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-04 12:19:16,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:19:17,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:17,049 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 12:19:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:17,131 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-04 12:19:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:17,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 12:19:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:17,146 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:19:17,147 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:19:17,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:19:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:19:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:19:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-04 12:19:17,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-04 12:19:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:17,202 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-04 12:19:17,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 12:19:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:19:17,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:17,203 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:17,203 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:17,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-04 12:19:17,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:17,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:19:17,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:17,300 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:17,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:19:17,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:19:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:19:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:19:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:19:17,413 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-04 12:19:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:17,474 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-04 12:19:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:19:17,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 12:19:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:17,476 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:19:17,476 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:19:17,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:19:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:19:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:19:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:19:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-04 12:19:17,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-04 12:19:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:17,483 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-04 12:19:17,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:19:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 12:19:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:19:17,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:17,484 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-04 12:19:17,484 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:17,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-04 12:19:17,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:19:17,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:17,596 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 12:19:17,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:17,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:17,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:17,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:19:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:17,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:19:17,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:19:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:19:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:19:17,677 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-04 12:19:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:17,779 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 12:19:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:19:17,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-04 12:19:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:17,781 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:19:17,781 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:19:17,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:19:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:19:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:19:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:19:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-04 12:19:17,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-04 12:19:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:17,788 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-04 12:19:17,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:19:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 12:19:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:19:17,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:17,790 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-04 12:19:17,791 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:17,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-04 12:19:17,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:17,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 12:19:17,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:17,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:18,052 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:19:18,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:18,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 12:19:18,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:18,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:19:18,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:19:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:19:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:19:18,099 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-04 12:19:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:18,241 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-04 12:19:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:19:18,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 12:19:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:18,244 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:19:18,244 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:19:18,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:19:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:19:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:19:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:19:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-04 12:19:18,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-04 12:19:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:18,252 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-04 12:19:18,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:19:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-04 12:19:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:19:18,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:18,253 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-04 12:19:18,254 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:18,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-04 12:19:18,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 12:19:18,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:18,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:18,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:18,457 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:18,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:18,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 12:19:18,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:18,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:19:18,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:19:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:19:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:19:18,497 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-04 12:19:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:18,548 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-04 12:19:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:19:18,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 12:19:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:18,551 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:19:18,551 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:19:18,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:19:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:19:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:19:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:19:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-04 12:19:18,558 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-04 12:19:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:18,558 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-04 12:19:18,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:19:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-04 12:19:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:19:18,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:18,559 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-04 12:19:18,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-04 12:19:18,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:19:18,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:18,752 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:18,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:18,798 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:19:18,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:18,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:19:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:19:18,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:19:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:19:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:19:18,833 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-10-04 12:19:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:18,898 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-04 12:19:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:19:18,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-04 12:19:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:18,900 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:19:18,900 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:19:18,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:19:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:19:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:19:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:19:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-04 12:19:18,907 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-10-04 12:19:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:18,907 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-04 12:19:18,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:19:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-04 12:19:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:19:18,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:18,909 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-04 12:19:18,909 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:18,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:18,910 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-10-04 12:19:18,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:18,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:18,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:18,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 12:19:19,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:19,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:19,239 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:19,349 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:19:19,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:19,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 12:19:19,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:19,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:19:19,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:19:19,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:19:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:19:19,398 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-10-04 12:19:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:19,644 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-04 12:19:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:19:19,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-04 12:19:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:19,646 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:19:19,646 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:19:19,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:19:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:19:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:19:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:19:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-04 12:19:19,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-10-04 12:19:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:19,654 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-04 12:19:19,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:19:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-04 12:19:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:19:19,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:19,655 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-04 12:19:19,656 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:19,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-10-04 12:19:19,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:19,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:19,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 12:19:19,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:19,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:19,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 12:19:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:19:19,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:19:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:19:19,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:19:19,908 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-10-04 12:19:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:19,987 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-10-04 12:19:19,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:19:19,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-04 12:19:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:19,995 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:19:19,995 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:19:19,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:19:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:19:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:19:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:19:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-04 12:19:20,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-10-04 12:19:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:20,006 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-04 12:19:20,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:19:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-04 12:19:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:19:20,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:20,010 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-04 12:19:20,010 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:20,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-10-04 12:19:20,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:20,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 12:19:20,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:20,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:20,505 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:20,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:20,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 12:19:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:19:20,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:19:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:19:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:19:20,544 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-04 12:19:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:20,627 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-10-04 12:19:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:19:20,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-04 12:19:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:20,629 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:19:20,629 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:19:20,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:19:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:19:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:19:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:19:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-04 12:19:20,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-10-04 12:19:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:20,637 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-04 12:19:20,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:19:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-04 12:19:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:19:20,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:20,638 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-04 12:19:20,639 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:20,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-10-04 12:19:20,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:20,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 12:19:20,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:20,893 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:20,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:21,059 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:19:21,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:21,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 12:19:21,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:21,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:19:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:19:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:19:21,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:19:21,110 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-10-04 12:19:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:21,306 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-04 12:19:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:19:21,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-04 12:19:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:21,307 INFO L225 Difference]: With dead ends: 69 [2018-10-04 12:19:21,308 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:19:21,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:19:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:19:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:19:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:19:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-04 12:19:21,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-10-04 12:19:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:21,315 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-04 12:19:21,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:19:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-04 12:19:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:19:21,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:21,316 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-04 12:19:21,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:21,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-10-04 12:19:21,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:21,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 12:19:21,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:21,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:21,625 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:21,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:21,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 12:19:21,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:21,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:19:21,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:19:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:19:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:19:21,664 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-10-04 12:19:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:21,731 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-04 12:19:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:19:21,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-04 12:19:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:21,733 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:19:21,733 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:19:21,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:19:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:19:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 12:19:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:19:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-04 12:19:21,741 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-10-04 12:19:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:21,742 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-04 12:19:21,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:19:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-04 12:19:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:19:21,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:21,743 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-10-04 12:19:21,744 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:21,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-10-04 12:19:21,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:21,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 12:19:21,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:21,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:21,919 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:21,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:19:21,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:21,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 12:19:21,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:21,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:19:21,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:19:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:19:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:19:21,999 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-10-04 12:19:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:22,078 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-04 12:19:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:19:22,079 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-04 12:19:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:22,080 INFO L225 Difference]: With dead ends: 81 [2018-10-04 12:19:22,080 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:19:22,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:19:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:19:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 12:19:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:19:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-04 12:19:22,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-10-04 12:19:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:22,088 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-04 12:19:22,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:19:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-04 12:19:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:19:22,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:22,089 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-10-04 12:19:22,089 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:22,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-10-04 12:19:22,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:22,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:22,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 12:19:22,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:22,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:22,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:22,391 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:19:22,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:22,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 12:19:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:22,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:19:22,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:19:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:19:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:19:22,451 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-10-04 12:19:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:22,554 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-10-04 12:19:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:19:22,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-04 12:19:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:22,555 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:19:22,555 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:19:22,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:19:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:19:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:19:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:19:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-04 12:19:22,563 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-10-04 12:19:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:22,563 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-04 12:19:22,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:19:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-04 12:19:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:19:22,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:22,565 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-10-04 12:19:22,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:22,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-10-04 12:19:22,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:22,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 12:19:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:22,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:22,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:22,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 12:19:22,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:22,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:19:22,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:19:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:19:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:19:22,918 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-10-04 12:19:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:23,296 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-04 12:19:23,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:19:23,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-04 12:19:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:23,297 INFO L225 Difference]: With dead ends: 93 [2018-10-04 12:19:23,297 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:19:23,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:19:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:19:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:19:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:19:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-04 12:19:23,305 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-10-04 12:19:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:23,305 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-04 12:19:23,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:19:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-04 12:19:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:19:23,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:23,307 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-10-04 12:19:23,307 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:23,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-10-04 12:19:23,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:23,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 12:19:23,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:23,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:23,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:23,656 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:23,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:23,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 12:19:23,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:23,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:19:23,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:19:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:19:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:19:23,703 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-10-04 12:19:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:23,893 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-10-04 12:19:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:19:23,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-04 12:19:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:23,894 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:19:23,894 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 12:19:23,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:19:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 12:19:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 12:19:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:19:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-04 12:19:23,903 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-10-04 12:19:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:23,904 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-04 12:19:23,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:19:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-04 12:19:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:19:23,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:23,909 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-10-04 12:19:23,909 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:23,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-10-04 12:19:23,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:23,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 12:19:24,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:24,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:24,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:24,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:19:24,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:24,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 12:19:24,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:24,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:19:24,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:19:24,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:19:24,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:19:24,516 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-10-04 12:19:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:25,017 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-04 12:19:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:19:25,018 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-04 12:19:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:25,019 INFO L225 Difference]: With dead ends: 105 [2018-10-04 12:19:25,019 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:19:25,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:19:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:19:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 12:19:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 12:19:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-04 12:19:25,025 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-10-04 12:19:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:25,026 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-04 12:19:25,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:19:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-04 12:19:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 12:19:25,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:25,027 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-10-04 12:19:25,028 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-10-04 12:19:25,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:25,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 12:19:25,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:25,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:25,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:25,400 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:25,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:25,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 12:19:25,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:25,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 12:19:25,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:19:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:19:25,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:19:25,448 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-10-04 12:19:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:25,626 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-04 12:19:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:19:25,626 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-04 12:19:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:25,627 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:19:25,627 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:19:25,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:19:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:19:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 12:19:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:19:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-04 12:19:25,633 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-10-04 12:19:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:25,633 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-04 12:19:25,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:19:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-04 12:19:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 12:19:25,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:25,634 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-10-04 12:19:25,634 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:25,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-10-04 12:19:25,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:25,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 12:19:26,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:26,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:26,047 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:26,117 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:19:26,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:26,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 12:19:26,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:26,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:19:26,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:19:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:19:26,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:19:26,159 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-10-04 12:19:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:26,246 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-10-04 12:19:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:19:26,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-04 12:19:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:26,248 INFO L225 Difference]: With dead ends: 117 [2018-10-04 12:19:26,248 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:19:26,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:19:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:19:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 12:19:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:19:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-04 12:19:26,256 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-10-04 12:19:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:26,256 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-04 12:19:26,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:19:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-04 12:19:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:19:26,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:26,258 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-10-04 12:19:26,258 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:26,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-10-04 12:19:26,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:26,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:26,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:26,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 12:19:26,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:26,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:26,612 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:19:26,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:26,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 12:19:26,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:26,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:19:26,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:19:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:19:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:19:26,652 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-10-04 12:19:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:26,772 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-04 12:19:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:19:26,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-04 12:19:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:26,774 INFO L225 Difference]: With dead ends: 123 [2018-10-04 12:19:26,774 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:19:26,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:19:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:19:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 12:19:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 12:19:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-10-04 12:19:26,780 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-10-04 12:19:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:26,781 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-10-04 12:19:26,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:19:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-10-04 12:19:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 12:19:26,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:26,782 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-10-04 12:19:26,782 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:26,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-10-04 12:19:26,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:26,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:26,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 12:19:27,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:27,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:27,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:27,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 12:19:27,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:27,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 12:19:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:19:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:19:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:19:27,186 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-10-04 12:19:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:27,337 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-04 12:19:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:19:27,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-04 12:19:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:27,339 INFO L225 Difference]: With dead ends: 129 [2018-10-04 12:19:27,339 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:19:27,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:19:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:19:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 12:19:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:19:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-04 12:19:27,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-10-04 12:19:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:27,347 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-04 12:19:27,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:19:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-04 12:19:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:19:27,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:27,349 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-10-04 12:19:27,349 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:27,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-10-04 12:19:27,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:27,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 12:19:28,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:28,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:28,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:28,396 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:28,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:28,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 12:19:28,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:28,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:19:28,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:19:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:19:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:19:28,446 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-10-04 12:19:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:28,617 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-04 12:19:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:19:28,618 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-04 12:19:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:28,619 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:19:28,619 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 12:19:28,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:19:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 12:19:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 12:19:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 12:19:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-04 12:19:28,624 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-10-04 12:19:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:28,624 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-04 12:19:28,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:19:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-04 12:19:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:19:28,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:28,625 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-10-04 12:19:28,625 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:28,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-10-04 12:19:28,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:28,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-04 12:19:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:29,249 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:29,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:29,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:19:29,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:29,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-04 12:19:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:19:29,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:19:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:19:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:19:29,392 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-04 12:19:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:29,539 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-04 12:19:29,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:19:29,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-04 12:19:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:29,542 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:19:29,542 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 12:19:29,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:19:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 12:19:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 12:19:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 12:19:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-04 12:19:29,546 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2018-10-04 12:19:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:29,547 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-04 12:19:29,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:19:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-04 12:19:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 12:19:29,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:29,548 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-10-04 12:19:29,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:29,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 22 times [2018-10-04 12:19:29,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:29,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:29,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:29,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-04 12:19:29,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:29,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:29,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:29,938 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:29,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:29,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-04 12:19:29,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:29,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 12:19:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:19:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:19:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:19:29,985 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2018-10-04 12:19:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:30,091 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-04 12:19:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:19:30,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-04 12:19:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:30,093 INFO L225 Difference]: With dead ends: 147 [2018-10-04 12:19:30,093 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 12:19:30,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:19:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 12:19:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 12:19:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 12:19:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-10-04 12:19:30,097 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-10-04 12:19:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:30,098 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-10-04 12:19:30,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:19:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-10-04 12:19:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:19:30,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:30,099 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-10-04 12:19:30,099 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:30,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 23 times [2018-10-04 12:19:30,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:30,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-04 12:19:30,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:30,919 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:31,095 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:19:31,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:31,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-04 12:19:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:19:31,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:19:31,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:19:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:19:31,142 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 26 states. [2018-10-04 12:19:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:31,237 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-10-04 12:19:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:19:31,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-10-04 12:19:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:31,239 INFO L225 Difference]: With dead ends: 153 [2018-10-04 12:19:31,239 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 12:19:31,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:19:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 12:19:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 12:19:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 12:19:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-04 12:19:31,243 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-10-04 12:19:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:31,244 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-04 12:19:31,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:19:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-04 12:19:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 12:19:31,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:31,245 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-10-04 12:19:31,245 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:31,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 24 times [2018-10-04 12:19:31,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:31,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 12:19:31,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:31,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:32,113 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:19:32,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:32,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 12:19:32,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:32,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:19:32,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:19:32,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:19:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:19:32,164 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2018-10-04 12:19:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:32,373 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-04 12:19:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:19:32,374 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-10-04 12:19:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:32,375 INFO L225 Difference]: With dead ends: 159 [2018-10-04 12:19:32,375 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 12:19:32,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:19:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 12:19:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-04 12:19:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:19:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-04 12:19:32,381 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-10-04 12:19:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:32,382 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-04 12:19:32,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:19:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-04 12:19:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 12:19:32,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:32,383 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-10-04 12:19:32,383 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:32,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 25 times [2018-10-04 12:19:32,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:32,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:32,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-04 12:19:33,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:33,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:33,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:33,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-04 12:19:33,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:33,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 12:19:33,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:19:33,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:19:33,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:19:33,322 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 28 states. [2018-10-04 12:19:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:33,454 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-04 12:19:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:19:33,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-10-04 12:19:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:33,456 INFO L225 Difference]: With dead ends: 165 [2018-10-04 12:19:33,456 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 12:19:33,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:19:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 12:19:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-04 12:19:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 12:19:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-04 12:19:33,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-10-04 12:19:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:33,463 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-04 12:19:33,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:19:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-04 12:19:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-04 12:19:33,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:33,464 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-10-04 12:19:33,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:33,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 26 times [2018-10-04 12:19:33,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:33,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-04 12:19:34,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:34,543 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:34,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:34,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:34,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-04 12:19:34,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:19:34,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:19:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:19:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:19:34,647 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2018-10-04 12:19:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:34,842 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-04 12:19:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:19:34,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-10-04 12:19:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:34,844 INFO L225 Difference]: With dead ends: 171 [2018-10-04 12:19:34,844 INFO L226 Difference]: Without dead ends: 115 [2018-10-04 12:19:34,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:19:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-04 12:19:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-04 12:19:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 12:19:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-04 12:19:34,848 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2018-10-04 12:19:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:34,848 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-04 12:19:34,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:19:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-04 12:19:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-04 12:19:34,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:34,849 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-10-04 12:19:34,849 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:34,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 27 times [2018-10-04 12:19:34,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:34,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:34,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:34,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-04 12:19:35,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:35,418 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:35,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:35,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:19:35,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:35,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-04 12:19:35,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:35,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:19:35,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:19:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:19:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:19:35,673 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-10-04 12:19:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:35,787 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-04 12:19:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:19:35,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-10-04 12:19:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:35,788 INFO L225 Difference]: With dead ends: 177 [2018-10-04 12:19:35,788 INFO L226 Difference]: Without dead ends: 119 [2018-10-04 12:19:35,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:19:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-04 12:19:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-04 12:19:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 12:19:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-04 12:19:35,793 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-10-04 12:19:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:35,794 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-04 12:19:35,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:19:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-04 12:19:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 12:19:35,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:35,795 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-10-04 12:19:35,795 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:35,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:35,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 28 times [2018-10-04 12:19:35,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:35,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-04 12:19:36,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:36,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:36,324 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:36,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:36,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-04 12:19:36,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:36,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:19:36,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:19:36,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:19:36,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:19:36,380 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2018-10-04 12:19:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:36,686 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-04 12:19:36,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:19:36,687 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-04 12:19:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:36,688 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:19:36,688 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:19:36,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:19:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:19:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-04 12:19:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 12:19:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-04 12:19:36,694 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-10-04 12:19:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:36,694 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-04 12:19:36,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:19:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-04 12:19:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 12:19:36,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:36,695 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-10-04 12:19:36,695 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:36,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 29 times [2018-10-04 12:19:36,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:36,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:36,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:36,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:36,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-04 12:19:37,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:37,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:37,579 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:37,838 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:19:37,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:37,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-04 12:19:37,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:19:37,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:19:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:19:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:19:37,881 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 32 states. [2018-10-04 12:19:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:38,021 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2018-10-04 12:19:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:19:38,022 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-10-04 12:19:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:38,023 INFO L225 Difference]: With dead ends: 189 [2018-10-04 12:19:38,023 INFO L226 Difference]: Without dead ends: 127 [2018-10-04 12:19:38,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:19:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-04 12:19:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-04 12:19:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 12:19:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-04 12:19:38,029 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-10-04 12:19:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:38,029 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-04 12:19:38,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:19:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-04 12:19:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-04 12:19:38,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:38,030 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-10-04 12:19:38,031 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:38,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 30 times [2018-10-04 12:19:38,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:38,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:38,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 12:19:38,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:38,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:38,733 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:19:38,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:38,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 12:19:38,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:19:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:19:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:19:38,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:19:38,786 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2018-10-04 12:19:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:38,995 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-10-04 12:19:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:19:38,995 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-10-04 12:19:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:38,996 INFO L225 Difference]: With dead ends: 195 [2018-10-04 12:19:38,997 INFO L226 Difference]: Without dead ends: 131 [2018-10-04 12:19:38,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:19:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-04 12:19:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-04 12:19:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 12:19:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-04 12:19:39,003 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2018-10-04 12:19:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:39,004 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-04 12:19:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:19:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-04 12:19:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-04 12:19:39,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:39,005 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-10-04 12:19:39,005 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 31 times [2018-10-04 12:19:39,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:39,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-04 12:19:39,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:39,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:39,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-04 12:19:39,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:39,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 12:19:39,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:19:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:19:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:19:39,903 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 34 states. [2018-10-04 12:19:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:40,093 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-10-04 12:19:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:19:40,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-10-04 12:19:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:40,097 INFO L225 Difference]: With dead ends: 201 [2018-10-04 12:19:40,097 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:19:40,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:19:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:19:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 12:19:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 12:19:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-04 12:19:40,103 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2018-10-04 12:19:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:40,104 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-04 12:19:40,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:19:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-04 12:19:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-04 12:19:40,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:40,106 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-10-04 12:19:40,106 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:40,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 32 times [2018-10-04 12:19:40,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:40,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:40,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-04 12:19:41,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:41,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:41,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:41,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:41,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-04 12:19:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:41,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 12:19:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:19:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:19:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:19:41,425 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2018-10-04 12:19:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:41,562 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-10-04 12:19:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:19:41,562 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-04 12:19:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:41,563 INFO L225 Difference]: With dead ends: 207 [2018-10-04 12:19:41,564 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:19:41,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:19:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:19:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-04 12:19:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 12:19:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-04 12:19:41,569 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-10-04 12:19:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:41,569 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-04 12:19:41,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:19:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-04 12:19:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-04 12:19:41,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:41,570 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-10-04 12:19:41,571 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:41,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 33 times [2018-10-04 12:19:41,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:41,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-04 12:19:42,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:42,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:42,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:19:42,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:42,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-04 12:19:42,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:19:42,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:19:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:19:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:19:42,609 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 36 states. [2018-10-04 12:19:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:42,784 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2018-10-04 12:19:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:19:42,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-10-04 12:19:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:42,786 INFO L225 Difference]: With dead ends: 213 [2018-10-04 12:19:42,786 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 12:19:42,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:19:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 12:19:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-04 12:19:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-04 12:19:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-04 12:19:42,790 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2018-10-04 12:19:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:42,790 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-04 12:19:42,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:19:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-04 12:19:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-04 12:19:42,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:42,792 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-10-04 12:19:42,792 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:42,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 34 times [2018-10-04 12:19:42,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:42,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:42,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-04 12:19:43,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:43,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:43,789 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:43,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:43,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-04 12:19:43,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:43,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 12:19:43,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:19:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:19:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:19:43,832 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2018-10-04 12:19:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:44,181 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-10-04 12:19:44,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:19:44,181 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-04 12:19:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:44,182 INFO L225 Difference]: With dead ends: 219 [2018-10-04 12:19:44,182 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:19:44,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:19:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:19:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-04 12:19:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 12:19:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-04 12:19:44,187 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2018-10-04 12:19:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:44,187 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-04 12:19:44,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:19:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-04 12:19:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-04 12:19:44,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:44,188 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-10-04 12:19:44,189 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 35 times [2018-10-04 12:19:44,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:44,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-04 12:19:45,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:45,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:46,059 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:19:46,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:46,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-04 12:19:46,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:46,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:19:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:19:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:19:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:19:46,114 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 38 states. [2018-10-04 12:19:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:46,348 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-10-04 12:19:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:19:46,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-10-04 12:19:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:46,350 INFO L225 Difference]: With dead ends: 225 [2018-10-04 12:19:46,350 INFO L226 Difference]: Without dead ends: 151 [2018-10-04 12:19:46,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:19:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-04 12:19:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-04 12:19:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-04 12:19:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-04 12:19:46,356 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-10-04 12:19:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:46,357 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-04 12:19:46,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:19:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-04 12:19:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-04 12:19:46,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:46,358 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-10-04 12:19:46,358 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:46,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 36 times [2018-10-04 12:19:46,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:46,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-04 12:19:47,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:47,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:47,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:47,683 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:19:47,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:47,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-04 12:19:47,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:47,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:19:47,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:19:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:19:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:19:47,743 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-10-04 12:19:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:47,958 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-10-04 12:19:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:19:47,959 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-10-04 12:19:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:47,960 INFO L225 Difference]: With dead ends: 231 [2018-10-04 12:19:47,960 INFO L226 Difference]: Without dead ends: 155 [2018-10-04 12:19:47,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:19:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-04 12:19:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-04 12:19:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-04 12:19:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-10-04 12:19:47,964 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-10-04 12:19:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:47,965 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-10-04 12:19:47,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:19:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-10-04 12:19:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-04 12:19:47,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:47,966 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-10-04 12:19:47,966 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:47,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 37 times [2018-10-04 12:19:47,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:47,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:47,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-04 12:19:48,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:48,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:48,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:48,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-04 12:19:48,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:48,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 12:19:48,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:19:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:19:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:19:48,907 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-10-04 12:19:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:49,077 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2018-10-04 12:19:49,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:19:49,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-10-04 12:19:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:49,078 INFO L225 Difference]: With dead ends: 237 [2018-10-04 12:19:49,079 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 12:19:49,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:19:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 12:19:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-04 12:19:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-04 12:19:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-04 12:19:49,084 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-10-04 12:19:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:49,084 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-04 12:19:49,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:19:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-04 12:19:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-04 12:19:49,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:49,085 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-10-04 12:19:49,085 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:49,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 38 times [2018-10-04 12:19:49,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:49,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:49,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-04 12:19:49,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:49,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:19:50,092 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:19:50,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:50,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-04 12:19:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 12:19:50,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:19:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:19:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:19:50,155 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2018-10-04 12:19:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:50,584 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-04 12:19:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:19:50,584 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-04 12:19:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:50,586 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:19:50,586 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 12:19:50,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:19:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 12:19:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-04 12:19:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-04 12:19:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-04 12:19:50,593 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2018-10-04 12:19:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:50,593 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-04 12:19:50,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:19:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-04 12:19:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-04 12:19:50,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:50,594 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-10-04 12:19:50,594 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:50,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 39 times [2018-10-04 12:19:50,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:50,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:50,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:50,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:50,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-04 12:19:51,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:51,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:51,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:19:52,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:19:52,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:52,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-04 12:19:52,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 12:19:52,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:19:52,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:19:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:19:52,514 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-04 12:19:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:54,152 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-10-04 12:19:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:19:54,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-04 12:19:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:54,154 INFO L225 Difference]: With dead ends: 249 [2018-10-04 12:19:54,154 INFO L226 Difference]: Without dead ends: 167 [2018-10-04 12:19:54,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:19:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-04 12:19:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-04 12:19:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 12:19:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-10-04 12:19:54,159 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 162 [2018-10-04 12:19:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:54,160 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-10-04 12:19:54,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:19:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-10-04 12:19:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-04 12:19:54,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:54,161 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-10-04 12:19:54,161 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:54,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 40 times [2018-10-04 12:19:54,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:54,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:54,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:54,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-04 12:19:55,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:55,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:55,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:19:55,758 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:19:55,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:55,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-04 12:19:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 12:19:55,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:19:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:19:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:19:55,823 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2018-10-04 12:19:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:56,008 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-04 12:19:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:19:56,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-04 12:19:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:56,010 INFO L225 Difference]: With dead ends: 255 [2018-10-04 12:19:56,010 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 12:19:56,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:19:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 12:19:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-04 12:19:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-04 12:19:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-10-04 12:19:56,015 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-10-04 12:19:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:56,016 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-10-04 12:19:56,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:19:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-10-04 12:19:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-04 12:19:56,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:56,017 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-10-04 12:19:56,017 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:56,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 41 times [2018-10-04 12:19:56,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:56,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-04 12:19:56,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:56,855 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:19:57,647 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:19:57,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:57,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-04 12:19:57,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 12:19:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:19:57,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:19:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:19:57,725 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-10-04 12:19:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:58,000 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2018-10-04 12:19:58,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:19:58,001 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-10-04 12:19:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:58,003 INFO L225 Difference]: With dead ends: 261 [2018-10-04 12:19:58,003 INFO L226 Difference]: Without dead ends: 175 [2018-10-04 12:19:58,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:19:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-04 12:19:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-04 12:19:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 12:19:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-04 12:19:58,008 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-10-04 12:19:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-04 12:19:58,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:19:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-04 12:19:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-04 12:19:58,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:58,010 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-10-04 12:19:58,010 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:58,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 42 times [2018-10-04 12:19:58,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:58,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:58,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 12:19:59,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:59,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:19:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:19:59,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:19:59,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:19:59,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 12:19:59,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 12:19:59,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:19:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:19:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:19:59,550 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2018-10-04 12:19:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:59,722 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2018-10-04 12:19:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:19:59,723 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-10-04 12:19:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:59,724 INFO L225 Difference]: With dead ends: 267 [2018-10-04 12:19:59,725 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 12:19:59,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:19:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 12:19:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-04 12:19:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-04 12:19:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-04 12:19:59,730 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-10-04 12:19:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:59,730 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-04 12:19:59,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:19:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-04 12:19:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-04 12:19:59,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:59,732 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-10-04 12:19:59,732 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:59,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 43 times [2018-10-04 12:19:59,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:59,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:59,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:59,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:19:59,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-04 12:20:01,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:01,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:01,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-04 12:20:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 12:20:01,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:20:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:20:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:20:01,369 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 46 states. [2018-10-04 12:20:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:01,602 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2018-10-04 12:20:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:20:01,602 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-10-04 12:20:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:01,604 INFO L225 Difference]: With dead ends: 273 [2018-10-04 12:20:01,604 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 12:20:01,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:20:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 12:20:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-04 12:20:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 12:20:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-04 12:20:01,608 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-10-04 12:20:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:01,609 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-04 12:20:01,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:20:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-04 12:20:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 12:20:01,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:01,610 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-10-04 12:20:01,610 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:01,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 44 times [2018-10-04 12:20:01,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:01,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 12:20:02,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:02,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:20:02,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:20:02,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:02,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 12:20:02,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:02,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 12:20:02,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:20:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:20:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:20:02,654 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2018-10-04 12:20:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:02,858 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2018-10-04 12:20:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:20:02,859 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-10-04 12:20:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:02,860 INFO L225 Difference]: With dead ends: 279 [2018-10-04 12:20:02,861 INFO L226 Difference]: Without dead ends: 187 [2018-10-04 12:20:02,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:20:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-04 12:20:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-04 12:20:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 12:20:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-04 12:20:02,866 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-10-04 12:20:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:02,866 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-04 12:20:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:20:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-04 12:20:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-04 12:20:02,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:02,868 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-10-04 12:20:02,868 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:02,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 45 times [2018-10-04 12:20:02,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:02,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-04 12:20:04,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:04,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:20:05,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:20:05,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:05,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-04 12:20:05,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:05,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 12:20:05,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:20:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:20:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:20:05,181 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 48 states. [2018-10-04 12:20:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:05,445 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-04 12:20:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:20:05,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-10-04 12:20:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:05,447 INFO L225 Difference]: With dead ends: 285 [2018-10-04 12:20:05,448 INFO L226 Difference]: Without dead ends: 191 [2018-10-04 12:20:05,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:20:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-04 12:20:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-04 12:20:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-04 12:20:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-10-04 12:20:05,453 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-10-04 12:20:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:05,453 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-10-04 12:20:05,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:20:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-10-04 12:20:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-04 12:20:05,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:05,455 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-10-04 12:20:05,455 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:05,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 46 times [2018-10-04 12:20:05,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:05,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-04 12:20:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:06,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:06,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:20:06,798 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:20:06,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:06,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-04 12:20:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 12:20:06,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:20:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:20:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:20:06,871 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2018-10-04 12:20:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:07,145 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2018-10-04 12:20:07,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:20:07,146 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-04 12:20:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:07,147 INFO L225 Difference]: With dead ends: 291 [2018-10-04 12:20:07,147 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 12:20:07,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:20:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 12:20:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-04 12:20:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-04 12:20:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-04 12:20:07,153 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-10-04 12:20:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:07,153 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-04 12:20:07,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:20:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-04 12:20:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-04 12:20:07,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:07,155 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-10-04 12:20:07,155 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:07,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 47 times [2018-10-04 12:20:07,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:07,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 12:20:09,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:09,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:20:10,328 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:20:10,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:10,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 12:20:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:10,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 12:20:10,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:20:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:20:10,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:20:10,442 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 50 states. [2018-10-04 12:20:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:10,817 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2018-10-04 12:20:10,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:20:10,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-10-04 12:20:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:10,819 INFO L225 Difference]: With dead ends: 297 [2018-10-04 12:20:10,819 INFO L226 Difference]: Without dead ends: 199 [2018-10-04 12:20:10,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:20:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-04 12:20:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-04 12:20:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-04 12:20:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-04 12:20:10,825 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-10-04 12:20:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:10,826 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-04 12:20:10,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:20:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-04 12:20:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-04 12:20:10,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:10,827 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-10-04 12:20:10,828 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:10,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 48 times [2018-10-04 12:20:10,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:10,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-04 12:20:11,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:11,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:20:12,608 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:20:12,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:12,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-04 12:20:12,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:12,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 12:20:12,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:20:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:20:12,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:20:12,668 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2018-10-04 12:20:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:12,930 INFO L93 Difference]: Finished difference Result 303 states and 306 transitions. [2018-10-04 12:20:12,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:20:12,931 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-04 12:20:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:12,932 INFO L225 Difference]: With dead ends: 303 [2018-10-04 12:20:12,932 INFO L226 Difference]: Without dead ends: 203 [2018-10-04 12:20:12,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:20:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-04 12:20:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-04 12:20:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 12:20:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-04 12:20:12,937 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 198 [2018-10-04 12:20:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:12,937 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-04 12:20:12,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:20:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-04 12:20:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-04 12:20:12,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:12,938 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-10-04 12:20:12,938 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:12,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 49 times [2018-10-04 12:20:12,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:12,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 12:20:14,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:14,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:20:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:14,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 12:20:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 12:20:14,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:20:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:20:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:20:14,736 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 52 states. [2018-10-04 12:20:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:15,081 INFO L93 Difference]: Finished difference Result 309 states and 312 transitions. [2018-10-04 12:20:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:20:15,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-10-04 12:20:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:15,084 INFO L225 Difference]: With dead ends: 309 [2018-10-04 12:20:15,084 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 12:20:15,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:20:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 12:20:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-04 12:20:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:20:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-10-04 12:20:15,089 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-10-04 12:20:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:15,089 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-10-04 12:20:15,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:20:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-10-04 12:20:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 12:20:15,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:15,091 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-10-04 12:20:15,091 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:15,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 50 times [2018-10-04 12:20:15,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:15,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:15,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:20:16,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:16,342 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 12:20:16,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:20:16,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:20:16,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:16,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 12:20:16,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:16,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 12:20:16,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:20:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:20:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:20:16,509 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2018-10-04 12:20:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:17,463 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-10-04 12:20:17,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:20:17,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-10-04 12:20:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:17,465 INFO L225 Difference]: With dead ends: 315 [2018-10-04 12:20:17,465 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 12:20:17,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:20:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 12:20:17,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-04 12:20:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-04 12:20:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-04 12:20:17,470 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-10-04 12:20:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:17,471 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-04 12:20:17,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:20:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-04 12:20:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-04 12:20:17,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:17,472 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-10-04 12:20:17,472 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:17,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 51 times [2018-10-04 12:20:17,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:17,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:17,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-04 12:20:18,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:18,617 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:20:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:20:19,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 12:20:19,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:19,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-04 12:20:19,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:19,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 12:20:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:20:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:20:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:20:19,879 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 54 states. [2018-10-04 12:20:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:20,370 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-10-04 12:20:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:20:20,370 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-10-04 12:20:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:20,372 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:20:20,372 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:20:20,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:20:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:20:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-04 12:20:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 12:20:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-04 12:20:20,378 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 210 [2018-10-04 12:20:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:20,379 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-04 12:20:20,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:20:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-04 12:20:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-04 12:20:20,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:20,380 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-10-04 12:20:20,381 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 52 times [2018-10-04 12:20:20,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:20,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:20,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-04 12:20:21,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:21,842 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 12:20:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:20:21,939 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:20:21,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:21,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-04 12:20:22,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:22,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 12:20:22,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:20:22,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:20:22,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:20:22,035 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2018-10-04 12:20:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:22,317 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-10-04 12:20:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:20:22,317 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-10-04 12:20:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:22,319 INFO L225 Difference]: With dead ends: 327 [2018-10-04 12:20:22,319 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 12:20:22,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:20:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 12:20:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-04 12:20:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-04 12:20:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-10-04 12:20:22,324 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-10-04 12:20:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:22,325 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-10-04 12:20:22,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:20:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-10-04 12:20:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-04 12:20:22,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:22,326 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-10-04 12:20:22,327 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:22,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 53 times [2018-10-04 12:20:22,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:22,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:22,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-04 12:20:23,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:23,607 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 12:20:23,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:20:25,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 12:20:25,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:25,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-04 12:20:25,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:25,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 12:20:25,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:20:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:20:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:20:25,535 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 56 states. [2018-10-04 12:20:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:25,871 INFO L93 Difference]: Finished difference Result 333 states and 336 transitions. [2018-10-04 12:20:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:20:25,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-10-04 12:20:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:25,873 INFO L225 Difference]: With dead ends: 333 [2018-10-04 12:20:25,874 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 12:20:25,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:20:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 12:20:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-04 12:20:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-04 12:20:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-04 12:20:25,879 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-10-04 12:20:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-04 12:20:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:20:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-04 12:20:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-04 12:20:25,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:25,880 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-10-04 12:20:25,880 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 54 times [2018-10-04 12:20:25,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:25,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 12:20:27,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:27,055 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 12:20:27,063 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:20:27,995 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 12:20:27,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:28,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 12:20:28,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:28,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 12:20:28,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:20:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:20:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:20:28,077 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2018-10-04 12:20:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:28,447 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-10-04 12:20:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:20:28,448 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-10-04 12:20:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:28,449 INFO L225 Difference]: With dead ends: 339 [2018-10-04 12:20:28,449 INFO L226 Difference]: Without dead ends: 227 [2018-10-04 12:20:28,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:20:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-04 12:20:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-04 12:20:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 12:20:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-10-04 12:20:28,455 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 222 [2018-10-04 12:20:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:28,455 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-10-04 12:20:28,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:20:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-10-04 12:20:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-04 12:20:28,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:28,457 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-10-04 12:20:28,457 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:28,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 55 times [2018-10-04 12:20:28,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:28,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 12:20:30,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:30,242 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 12:20:30,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:30,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 12:20:30,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:30,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 12:20:30,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:20:30,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:20:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:20:30,404 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 58 states. [2018-10-04 12:20:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:30,682 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-10-04 12:20:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:20:30,682 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-10-04 12:20:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:30,684 INFO L225 Difference]: With dead ends: 345 [2018-10-04 12:20:30,684 INFO L226 Difference]: Without dead ends: 231 [2018-10-04 12:20:30,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:20:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-04 12:20:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-04 12:20:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-04 12:20:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-04 12:20:30,690 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 226 [2018-10-04 12:20:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:30,690 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-04 12:20:30,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:20:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-04 12:20:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-04 12:20:30,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:30,691 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-10-04 12:20:30,692 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:30,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 56 times [2018-10-04 12:20:30,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:30,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:30,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-04 12:20:32,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:32,046 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:20:32,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:20:32,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:20:32,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:32,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-04 12:20:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:32,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 12:20:32,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:20:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:20:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:20:32,239 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-04 12:20:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:33,280 INFO L93 Difference]: Finished difference Result 351 states and 354 transitions. [2018-10-04 12:20:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:20:33,280 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-04 12:20:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:33,282 INFO L225 Difference]: With dead ends: 351 [2018-10-04 12:20:33,282 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 12:20:33,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:20:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 12:20:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 12:20:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 12:20:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-10-04 12:20:33,286 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 230 [2018-10-04 12:20:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:33,286 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-10-04 12:20:33,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:20:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-10-04 12:20:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-04 12:20:33,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:33,287 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-10-04 12:20:33,288 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:33,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 57 times [2018-10-04 12:20:33,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:33,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:33,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-04 12:20:34,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:34,942 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 12:20:34,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:20:36,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 12:20:36,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:36,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-04 12:20:36,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 12:20:36,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:20:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:20:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:20:36,776 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 60 states. [2018-10-04 12:20:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:37,267 INFO L93 Difference]: Finished difference Result 357 states and 360 transitions. [2018-10-04 12:20:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:20:37,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-10-04 12:20:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:37,269 INFO L225 Difference]: With dead ends: 357 [2018-10-04 12:20:37,269 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 12:20:37,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:20:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 12:20:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 12:20:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 12:20:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-10-04 12:20:37,273 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-10-04 12:20:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:37,274 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-10-04 12:20:37,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:20:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-10-04 12:20:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-04 12:20:37,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:37,275 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-10-04 12:20:37,275 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:37,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:37,275 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 58 times [2018-10-04 12:20:37,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:37,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:37,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-04 12:20:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:38,663 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 12:20:38,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:20:38,772 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:20:38,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:38,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-04 12:20:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 12:20:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:20:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:20:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:20:38,835 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2018-10-04 12:20:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:39,215 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-10-04 12:20:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:20:39,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-10-04 12:20:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:39,216 INFO L225 Difference]: With dead ends: 363 [2018-10-04 12:20:39,217 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 12:20:39,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:20:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 12:20:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-04 12:20:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 12:20:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-04 12:20:39,222 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 238 [2018-10-04 12:20:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:39,222 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-04 12:20:39,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:20:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-04 12:20:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-04 12:20:39,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:39,224 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-10-04 12:20:39,224 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:39,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 59 times [2018-10-04 12:20:39,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:39,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:39,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:39,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-04 12:20:41,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:41,107 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 12:20:41,114 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:20:43,724 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 12:20:43,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:43,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-04 12:20:43,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:43,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 12:20:43,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:20:43,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:20:43,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:20:43,808 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 62 states. [2018-10-04 12:20:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:44,290 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2018-10-04 12:20:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:20:44,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-10-04 12:20:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:44,291 INFO L225 Difference]: With dead ends: 369 [2018-10-04 12:20:44,291 INFO L226 Difference]: Without dead ends: 247 [2018-10-04 12:20:44,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:20:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-04 12:20:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-04 12:20:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 12:20:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-10-04 12:20:44,297 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 242 [2018-10-04 12:20:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:44,297 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-10-04 12:20:44,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:20:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-10-04 12:20:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-04 12:20:44,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:44,299 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-10-04 12:20:44,299 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:44,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 60 times [2018-10-04 12:20:44,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:44,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-04 12:20:45,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:45,911 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 12:20:45,919 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:20:47,420 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 12:20:47,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:47,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-04 12:20:47,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 12:20:47,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:20:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:20:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:20:47,521 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2018-10-04 12:20:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:47,877 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-10-04 12:20:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:20:47,878 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-10-04 12:20:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:47,879 INFO L225 Difference]: With dead ends: 375 [2018-10-04 12:20:47,879 INFO L226 Difference]: Without dead ends: 251 [2018-10-04 12:20:47,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:20:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-04 12:20:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-04 12:20:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-04 12:20:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-04 12:20:47,885 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 246 [2018-10-04 12:20:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:47,885 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-04 12:20:47,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:20:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-04 12:20:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-04 12:20:47,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:47,886 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-10-04 12:20:47,886 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:47,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 61 times [2018-10-04 12:20:47,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:47,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-04 12:20:49,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:49,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:20:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:49,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-04 12:20:49,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:49,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 12:20:49,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:20:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:20:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:20:49,553 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 64 states. [2018-10-04 12:20:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:49,932 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-10-04 12:20:49,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:20:49,932 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-10-04 12:20:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:49,934 INFO L225 Difference]: With dead ends: 381 [2018-10-04 12:20:49,934 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 12:20:49,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:20:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 12:20:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-04 12:20:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 12:20:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-04 12:20:49,940 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 250 [2018-10-04 12:20:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:49,940 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-04 12:20:49,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:20:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-04 12:20:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-04 12:20:49,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:49,941 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-10-04 12:20:49,941 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:49,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 62 times [2018-10-04 12:20:49,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:49,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:49,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:20:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-04 12:20:51,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:51,541 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 12:20:51,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:20:51,653 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:20:51,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:51,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-04 12:20:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 12:20:51,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:20:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:20:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:20:51,721 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2018-10-04 12:20:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:52,260 INFO L93 Difference]: Finished difference Result 387 states and 390 transitions. [2018-10-04 12:20:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:20:52,260 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-10-04 12:20:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:52,262 INFO L225 Difference]: With dead ends: 387 [2018-10-04 12:20:52,262 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 12:20:52,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:20:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 12:20:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-04 12:20:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 12:20:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-04 12:20:52,267 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-10-04 12:20:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:52,267 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-04 12:20:52,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:20:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-04 12:20:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-04 12:20:52,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:52,269 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-10-04 12:20:52,269 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:52,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 63 times [2018-10-04 12:20:52,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:52,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-04 12:20:53,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:53,872 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 12:20:53,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:20:56,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-04 12:20:56,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:56,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-04 12:20:56,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:56,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 12:20:56,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:20:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:20:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:20:56,321 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 66 states. [2018-10-04 12:20:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:56,853 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-10-04 12:20:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 12:20:56,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-10-04 12:20:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:56,855 INFO L225 Difference]: With dead ends: 393 [2018-10-04 12:20:56,855 INFO L226 Difference]: Without dead ends: 263 [2018-10-04 12:20:56,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:20:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-04 12:20:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-04 12:20:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-04 12:20:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-10-04 12:20:56,861 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 258 [2018-10-04 12:20:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:56,862 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-10-04 12:20:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:20:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-10-04 12:20:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-04 12:20:56,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:56,864 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-10-04 12:20:56,864 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:56,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 64 times [2018-10-04 12:20:56,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:56,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:20:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-04 12:20:58,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:20:58,483 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 12:20:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:20:58,599 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:20:58,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:20:58,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:20:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-04 12:20:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:20:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 12:20:58,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:20:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:20:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:20:58,670 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2018-10-04 12:20:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:20:59,185 INFO L93 Difference]: Finished difference Result 399 states and 402 transitions. [2018-10-04 12:20:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:20:59,185 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-04 12:20:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:20:59,187 INFO L225 Difference]: With dead ends: 399 [2018-10-04 12:20:59,187 INFO L226 Difference]: Without dead ends: 267 [2018-10-04 12:20:59,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:20:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-04 12:20:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-04 12:20:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-04 12:20:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-10-04 12:20:59,192 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-10-04 12:20:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:20:59,193 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-10-04 12:20:59,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:20:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-10-04 12:20:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 12:20:59,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:20:59,194 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-10-04 12:20:59,195 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:20:59,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:20:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 65 times [2018-10-04 12:20:59,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:20:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:20:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:59,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:20:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:20:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-04 12:21:01,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:01,180 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 12:21:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:21:04,516 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-04 12:21:04,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:04,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-04 12:21:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:04,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 12:21:04,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:21:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:21:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:21:04,610 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 68 states. [2018-10-04 12:21:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:05,167 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-10-04 12:21:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:21:05,167 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-10-04 12:21:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:05,168 INFO L225 Difference]: With dead ends: 405 [2018-10-04 12:21:05,168 INFO L226 Difference]: Without dead ends: 271 [2018-10-04 12:21:05,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:21:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-04 12:21:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-04 12:21:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-04 12:21:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-04 12:21:05,174 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 266 [2018-10-04 12:21:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:05,175 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-04 12:21:05,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:21:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-04 12:21:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-04 12:21:05,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:05,176 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-10-04 12:21:05,177 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:05,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 66 times [2018-10-04 12:21:05,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:05,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-04 12:21:06,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21: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 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 12:21:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:21:08,638 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-04 12:21:08,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-04 12:21:08,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:08,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 12:21:08,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:21:08,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:21:08,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:21:08,745 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2018-10-04 12:21:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:09,310 INFO L93 Difference]: Finished difference Result 411 states and 414 transitions. [2018-10-04 12:21:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:21:09,310 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-10-04 12:21:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:09,312 INFO L225 Difference]: With dead ends: 411 [2018-10-04 12:21:09,312 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 12:21:09,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:21:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 12:21:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-04 12:21:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 12:21:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-10-04 12:21:09,317 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 270 [2018-10-04 12:21:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:09,318 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-10-04 12:21:09,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:21:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-10-04 12:21:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-04 12:21:09,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:09,319 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-10-04 12:21:09,319 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:09,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 67 times [2018-10-04 12:21:09,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:09,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:09,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-04 12:21:11,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:11,444 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 12:21:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:21:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:11,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-04 12:21:11,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:11,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 12:21:11,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:21:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:21:11,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:21:11,638 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 70 states. [2018-10-04 12:21:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:12,315 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2018-10-04 12:21:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:21:12,315 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-10-04 12:21:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:12,317 INFO L225 Difference]: With dead ends: 417 [2018-10-04 12:21:12,317 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 12:21:12,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:21:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 12:21:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-04 12:21:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-04 12:21:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-10-04 12:21:12,324 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-10-04 12:21:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:12,324 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-10-04 12:21:12,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:21:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-10-04 12:21:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-04 12:21:12,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:12,326 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-10-04 12:21:12,326 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:12,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 68 times [2018-10-04 12:21:12,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:12,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:21:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-04 12:21:14,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:14,122 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 12:21:14,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:21:14,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:21:14,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:14,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-04 12:21:14,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:14,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 12:21:14,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 12:21:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 12:21:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:21:14,314 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2018-10-04 12:21:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:14,807 INFO L93 Difference]: Finished difference Result 423 states and 426 transitions. [2018-10-04 12:21:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:21:14,808 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-10-04 12:21:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:14,809 INFO L225 Difference]: With dead ends: 423 [2018-10-04 12:21:14,809 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 12:21:14,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:21:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 12:21:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-04 12:21:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-04 12:21:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-10-04 12:21:14,815 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 278 [2018-10-04 12:21:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:14,815 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-10-04 12:21:14,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 12:21:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-10-04 12:21:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-04 12:21:14,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:14,816 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-10-04 12:21:14,816 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 69 times [2018-10-04 12:21:14,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:14,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:14,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-04 12:21:16,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:16,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:21:16,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:21:20,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-04 12:21:20,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:20,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-04 12:21:20,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 12:21:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:21:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:21:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:21:20,443 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 72 states. [2018-10-04 12:21:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:20,984 INFO L93 Difference]: Finished difference Result 429 states and 432 transitions. [2018-10-04 12:21:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:21:20,984 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-10-04 12:21:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:20,986 INFO L225 Difference]: With dead ends: 429 [2018-10-04 12:21:20,986 INFO L226 Difference]: Without dead ends: 287 [2018-10-04 12:21:20,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:21:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-04 12:21:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-04 12:21:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-04 12:21:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-04 12:21:20,991 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 282 [2018-10-04 12:21:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:20,991 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-04 12:21:20,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:21:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-04 12:21:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-04 12:21:20,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:20,993 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-10-04 12:21:20,993 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:20,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 70 times [2018-10-04 12:21:20,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:20,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:20,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-04 12:21:22,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:22,903 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 12:21:22,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:21:23,022 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:21:23,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:23,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-04 12:21:23,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 12:21:23,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:21:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:21:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:21:23,118 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2018-10-04 12:21:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:23,862 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-10-04 12:21:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 12:21:23,862 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-10-04 12:21:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:23,864 INFO L225 Difference]: With dead ends: 435 [2018-10-04 12:21:23,864 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 12:21:23,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:21:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 12:21:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-04 12:21:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-04 12:21:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-10-04 12:21:23,869 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 286 [2018-10-04 12:21:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:23,870 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-10-04 12:21:23,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:21:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-10-04 12:21:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-04 12:21:23,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:23,871 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-10-04 12:21:23,871 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:23,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 71 times [2018-10-04 12:21:23,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:23,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:23,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-04 12:21:26,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:26,117 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 12:21:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:21:31,250 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-04 12:21:31,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:31,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-04 12:21:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 12:21:31,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:21:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:21:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:21:31,372 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 74 states. [2018-10-04 12:21:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:32,025 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2018-10-04 12:21:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:21:32,025 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-10-04 12:21:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:32,027 INFO L225 Difference]: With dead ends: 441 [2018-10-04 12:21:32,027 INFO L226 Difference]: Without dead ends: 295 [2018-10-04 12:21:32,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:21:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-04 12:21:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-04 12:21:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-04 12:21:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-04 12:21:32,034 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 290 [2018-10-04 12:21:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:32,034 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-04 12:21:32,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:21:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-04 12:21:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-04 12:21:32,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:32,036 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-10-04 12:21:32,036 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:32,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 72 times [2018-10-04 12:21:32,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:32,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:32,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-04 12:21:34,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:34,106 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 12:21:34,112 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:21:36,891 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-04 12:21:36,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:36,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-04 12:21:36,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:36,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 12:21:36,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:21:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:21:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:21:36,984 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2018-10-04 12:21:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:37,707 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-10-04 12:21:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:21:37,707 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-04 12:21:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:37,709 INFO L225 Difference]: With dead ends: 447 [2018-10-04 12:21:37,709 INFO L226 Difference]: Without dead ends: 299 [2018-10-04 12:21:37,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:21:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-04 12:21:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-04 12:21:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-04 12:21:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-04 12:21:37,717 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-10-04 12:21:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:37,717 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-04 12:21:37,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:21:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-04 12:21:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-04 12:21:37,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:37,719 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-10-04 12:21:37,719 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:37,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 73 times [2018-10-04 12:21:37,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:37,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-04 12:21:39,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:39,754 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 12:21:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:21:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:39,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-04 12:21:39,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 12:21:39,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:21:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:21:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:21:39,961 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 76 states. [2018-10-04 12:21:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:40,601 INFO L93 Difference]: Finished difference Result 453 states and 456 transitions. [2018-10-04 12:21:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:21:40,601 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-10-04 12:21:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:40,603 INFO L225 Difference]: With dead ends: 453 [2018-10-04 12:21:40,603 INFO L226 Difference]: Without dead ends: 303 [2018-10-04 12:21:40,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:21:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-04 12:21:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-04 12:21:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-04 12:21:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-04 12:21:40,608 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-10-04 12:21:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:40,608 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-04 12:21:40,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:21:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-04 12:21:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-04 12:21:40,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:40,610 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-10-04 12:21:40,610 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:40,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 74 times [2018-10-04 12:21:40,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:40,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:21:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-04 12:21:42,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:42,862 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 12:21:42,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:21:42,987 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:21:42,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:42,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-04 12:21:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:43,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 12:21:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:21:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:21:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:21:43,073 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2018-10-04 12:21:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:43,792 INFO L93 Difference]: Finished difference Result 459 states and 462 transitions. [2018-10-04 12:21:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:21:43,793 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-10-04 12:21:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:43,795 INFO L225 Difference]: With dead ends: 459 [2018-10-04 12:21:43,795 INFO L226 Difference]: Without dead ends: 307 [2018-10-04 12:21:43,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:21:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-04 12:21:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-04 12:21:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 12:21:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-10-04 12:21:43,800 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 302 [2018-10-04 12:21:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:43,800 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-10-04 12:21:43,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:21:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-10-04 12:21:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-04 12:21:43,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:43,802 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-10-04 12:21:43,802 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:43,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 75 times [2018-10-04 12:21:43,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:43,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-04 12:21:46,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:46,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:21:46,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:21:50,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-04 12:21:50,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:50,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-04 12:21:50,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:50,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 12:21:50,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:21:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:21:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:21:50,807 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 78 states. [2018-10-04 12:21:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:51,574 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-10-04 12:21:51,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 12:21:51,574 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-10-04 12:21:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:51,576 INFO L225 Difference]: With dead ends: 465 [2018-10-04 12:21:51,576 INFO L226 Difference]: Without dead ends: 311 [2018-10-04 12:21:51,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:21:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-04 12:21:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-04 12:21:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-04 12:21:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-10-04 12:21:51,583 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-10-04 12:21:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:51,583 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-10-04 12:21:51,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:21:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-10-04 12:21:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-04 12:21:51,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:51,585 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-10-04 12:21:51,585 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:51,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 76 times [2018-10-04 12:21:51,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:51,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:51,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-04 12:21:53,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:53,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:21:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:21:53,874 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:21:53,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:21:53,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:21:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-04 12:21:53,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:21:53,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 12:21:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:21:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:21:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:21:53,958 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2018-10-04 12:21:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:21:54,791 INFO L93 Difference]: Finished difference Result 471 states and 474 transitions. [2018-10-04 12:21:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 12:21:54,792 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-10-04 12:21:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:21:54,793 INFO L225 Difference]: With dead ends: 471 [2018-10-04 12:21:54,793 INFO L226 Difference]: Without dead ends: 315 [2018-10-04 12:21:54,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:21:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-04 12:21:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-04 12:21:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 12:21:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-04 12:21:54,800 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-10-04 12:21:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:21:54,800 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-04 12:21:54,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:21:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-04 12:21:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-04 12:21:54,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:21:54,801 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-10-04 12:21:54,801 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:21:54,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:21:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 77 times [2018-10-04 12:21:54,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:21:54,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:21:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:54,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:21:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:21:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:21:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-04 12:21:57,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:21:57,353 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 12:21:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:22:06,896 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-04 12:22:06,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:06,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-04 12:22:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 12:22:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:22:06,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:22:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:22:06,999 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 80 states. [2018-10-04 12:22:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:07,854 INFO L93 Difference]: Finished difference Result 477 states and 480 transitions. [2018-10-04 12:22:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 12:22:07,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-10-04 12:22:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:07,857 INFO L225 Difference]: With dead ends: 477 [2018-10-04 12:22:07,857 INFO L226 Difference]: Without dead ends: 319 [2018-10-04 12:22:07,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:22:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-04 12:22:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-04 12:22:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-04 12:22:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-10-04 12:22:07,862 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-10-04 12:22:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:07,862 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-10-04 12:22:07,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:22:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-10-04 12:22:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-04 12:22:07,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:07,864 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-10-04 12:22:07,864 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:07,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash 340317475, now seen corresponding path program 78 times [2018-10-04 12:22:07,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:07,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-04 12:22:10,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:10,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:22:13,700 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-04 12:22:13,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:13,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-04 12:22:13,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:13,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 12:22:13,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:22:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:22:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:22:13,801 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2018-10-04 12:22:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:14,605 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-10-04 12:22:14,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 12:22:14,606 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-10-04 12:22:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:14,607 INFO L225 Difference]: With dead ends: 483 [2018-10-04 12:22:14,608 INFO L226 Difference]: Without dead ends: 323 [2018-10-04 12:22:14,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:22:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-04 12:22:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-04 12:22:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-04 12:22:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-04 12:22:14,613 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 318 [2018-10-04 12:22:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:14,614 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-04 12:22:14,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:22:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-04 12:22:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-04 12:22:14,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:14,616 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-10-04 12:22:14,616 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:14,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -416893033, now seen corresponding path program 79 times [2018-10-04 12:22:14,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:14,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:14,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-04 12:22:17,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:17,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:22:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:17,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-04 12:22:17,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:17,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 12:22:17,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:22:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:22:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:22:17,539 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 82 states. [2018-10-04 12:22:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:18,563 INFO L93 Difference]: Finished difference Result 489 states and 492 transitions. [2018-10-04 12:22:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 12:22:18,563 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-10-04 12:22:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:18,565 INFO L225 Difference]: With dead ends: 489 [2018-10-04 12:22:18,565 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 12:22:18,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:22:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 12:22:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-04 12:22:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-04 12:22:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-04 12:22:18,573 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 322 [2018-10-04 12:22:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:18,573 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-04 12:22:18,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:22:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-04 12:22:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-04 12:22:18,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:18,575 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-10-04 12:22:18,576 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:18,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash -317071349, now seen corresponding path program 80 times [2018-10-04 12:22:18,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:18,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:18,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:22:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-04 12:22:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:21,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:21,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:22:21,372 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:22:21,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:21,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-04 12:22:21,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 12:22:21,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 12:22:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 12:22:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:22:21,483 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2018-10-04 12:22:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:22,366 INFO L93 Difference]: Finished difference Result 495 states and 498 transitions. [2018-10-04 12:22:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 12:22:22,366 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-10-04 12:22:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:22,368 INFO L225 Difference]: With dead ends: 495 [2018-10-04 12:22:22,368 INFO L226 Difference]: Without dead ends: 331 [2018-10-04 12:22:22,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:22:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-04 12:22:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-04 12:22:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-04 12:22:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-04 12:22:22,373 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 326 [2018-10-04 12:22:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:22,373 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-04 12:22:22,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 12:22:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-04 12:22:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-04 12:22:22,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:22,374 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-10-04 12:22:22,375 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425345, now seen corresponding path program 81 times [2018-10-04 12:22:22,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:22,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:22,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-04 12:22:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:24,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:24,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:22:31,427 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-04 12:22:31,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:31,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-04 12:22:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 12:22:31,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:22:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:22:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:22:31,522 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 84 states. [2018-10-04 12:22:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:32,634 INFO L93 Difference]: Finished difference Result 501 states and 504 transitions. [2018-10-04 12:22:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 12:22:32,635 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-10-04 12:22:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:32,637 INFO L225 Difference]: With dead ends: 501 [2018-10-04 12:22:32,637 INFO L226 Difference]: Without dead ends: 335 [2018-10-04 12:22:32,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:22:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-04 12:22:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-04 12:22:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-04 12:22:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-10-04 12:22:32,642 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 330 [2018-10-04 12:22:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:32,642 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-10-04 12:22:32,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:22:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-10-04 12:22:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-04 12:22:32,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:32,644 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-10-04 12:22:32,644 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:32,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 668205811, now seen corresponding path program 82 times [2018-10-04 12:22:32,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:32,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-04 12:22:35,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:35,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:35,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:22:35,352 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:22:35,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:35,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-04 12:22:35,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:35,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 12:22:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 12:22:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 12:22:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:22:35,444 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2018-10-04 12:22:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:36,347 INFO L93 Difference]: Finished difference Result 507 states and 510 transitions. [2018-10-04 12:22:36,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 12:22:36,347 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-10-04 12:22:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:36,349 INFO L225 Difference]: With dead ends: 507 [2018-10-04 12:22:36,350 INFO L226 Difference]: Without dead ends: 339 [2018-10-04 12:22:36,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:22:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-04 12:22:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-04 12:22:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-04 12:22:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-10-04 12:22:36,356 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-10-04 12:22:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:36,356 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-10-04 12:22:36,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 12:22:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-10-04 12:22:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-04 12:22:36,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:36,357 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-10-04 12:22:36,357 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:36,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 505740647, now seen corresponding path program 83 times [2018-10-04 12:22:36,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:36,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:36,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:36,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-04 12:22:39,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:39,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:39,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:22:48,540 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-04 12:22:48,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:48,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-04 12:22:48,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 12:22:48,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:22:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:22:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:22:48,647 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 86 states. [2018-10-04 12:22:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:49,632 INFO L93 Difference]: Finished difference Result 513 states and 516 transitions. [2018-10-04 12:22:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 12:22:49,632 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-10-04 12:22:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:49,634 INFO L225 Difference]: With dead ends: 513 [2018-10-04 12:22:49,634 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 12:22:49,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:22:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 12:22:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-04 12:22:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-04 12:22:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-04 12:22:49,640 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 338 [2018-10-04 12:22:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:49,640 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-04 12:22:49,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:22:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-04 12:22:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-04 12:22:49,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:49,641 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-10-04 12:22:49,642 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1251950043, now seen corresponding path program 84 times [2018-10-04 12:22:49,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:49,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:49,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:22:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-04 12:22:52,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:22:52,725 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:22:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:22:57,532 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-04 12:22:57,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:22:57,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:22:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-04 12:22:57,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:22:57,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 12:22:57,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 12:22:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 12:22:57,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:22:57,676 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2018-10-04 12:22:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:22:58,810 INFO L93 Difference]: Finished difference Result 519 states and 522 transitions. [2018-10-04 12:22:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 12:22:58,810 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-10-04 12:22:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:22:58,812 INFO L225 Difference]: With dead ends: 519 [2018-10-04 12:22:58,812 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 12:22:58,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:22:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 12:22:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-04 12:22:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-04 12:22:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-10-04 12:22:58,817 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-10-04 12:22:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:22:58,818 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-10-04 12:22:58,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 12:22:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-10-04 12:22:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-04 12:22:58,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:22:58,819 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-10-04 12:22:58,819 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:22:58,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:22:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1690813519, now seen corresponding path program 85 times [2018-10-04 12:22:58,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:22:58,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:22:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:58,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:22:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:22:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:23:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-04 12:23:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:23:01,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:23:01,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:23:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:23:01,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:23:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-04 12:23:01,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:23:01,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 12:23:01,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:23:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:23:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:23:01,780 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 88 states. [2018-10-04 12:23:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:23:02,694 INFO L93 Difference]: Finished difference Result 525 states and 528 transitions. [2018-10-04 12:23:02,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 12:23:02,695 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-10-04 12:23:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:23:02,696 INFO L225 Difference]: With dead ends: 525 [2018-10-04 12:23:02,696 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 12:23:02,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:23:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 12:23:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-04 12:23:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 12:23:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-10-04 12:23:02,703 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 346 [2018-10-04 12:23:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:23:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-10-04 12:23:02,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:23:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-10-04 12:23:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-04 12:23:02,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:23:02,705 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1] [2018-10-04 12:23:02,705 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:23:02,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:23:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -744255293, now seen corresponding path program 86 times [2018-10-04 12:23:02,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:23:02,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:23:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:23:02,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:23:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-04 12:23:05,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:23:05,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:23:05,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:23:05,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:23:05,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:23:05,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:23:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-04 12:23:05,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:23:05,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 12:23:05,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 12:23:05,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 12:23:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:23:05,758 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2018-10-04 12:23:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:23:06,990 INFO L93 Difference]: Finished difference Result 531 states and 534 transitions. [2018-10-04 12:23:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 12:23:06,990 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-10-04 12:23:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:23:06,992 INFO L225 Difference]: With dead ends: 531 [2018-10-04 12:23:06,992 INFO L226 Difference]: Without dead ends: 355 [2018-10-04 12:23:06,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:23:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-04 12:23:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-04 12:23:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-04 12:23:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-04 12:23:06,998 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 350 [2018-10-04 12:23:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:23:06,999 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-04 12:23:06,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 12:23:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-04 12:23:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-04 12:23:07,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:23:07,000 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-10-04 12:23:07,000 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:23:07,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:23:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1840751415, now seen corresponding path program 87 times [2018-10-04 12:23:07,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:23:07,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:23:07,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:07,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:23:07,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:23:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-04 12:23:10,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:23:10,087 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:23:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:23:18,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-04 12:23:18,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:23:18,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:23:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-04 12:23:18,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:23:18,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 12:23:18,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:23:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:23:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:23:18,217 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 90 states. [2018-10-04 12:23:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:23:19,083 INFO L93 Difference]: Finished difference Result 537 states and 540 transitions. [2018-10-04 12:23:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 12:23:19,084 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-10-04 12:23:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:23:19,086 INFO L225 Difference]: With dead ends: 537 [2018-10-04 12:23:19,086 INFO L226 Difference]: Without dead ends: 359 [2018-10-04 12:23:19,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:23:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-04 12:23:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-04 12:23:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-04 12:23:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-10-04 12:23:19,092 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-10-04 12:23:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:23:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-10-04 12:23:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:23:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-10-04 12:23:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-04 12:23:19,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:23:19,093 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1] [2018-10-04 12:23:19,094 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:23:19,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:23:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 956890027, now seen corresponding path program 88 times [2018-10-04 12:23:19,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:23:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:23:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:19,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:23:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:23:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-04 12:23:21,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:23:21,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:23:21,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:23:22,122 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:23:22,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:23:22,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:23:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-04 12:23:22,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:23:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 12:23:22,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 12:23:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 12:23:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 12:23:22,239 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2018-10-04 12:23:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:23:23,185 INFO L93 Difference]: Finished difference Result 543 states and 546 transitions. [2018-10-04 12:23:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 12:23:23,185 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-10-04 12:23:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:23:23,187 INFO L225 Difference]: With dead ends: 543 [2018-10-04 12:23:23,187 INFO L226 Difference]: Without dead ends: 363 [2018-10-04 12:23:23,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 12:23:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-04 12:23:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-04 12:23:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-04 12:23:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-04 12:23:23,193 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 358 [2018-10-04 12:23:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:23:23,193 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-04 12:23:23,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 12:23:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-04 12:23:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-04 12:23:23,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:23:23,195 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-10-04 12:23:23,195 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:23:23,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:23:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 723294751, now seen corresponding path program 89 times [2018-10-04 12:23:23,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:23:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:23:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:23,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:23:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:23:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 12:23:23,369 WARN L186 SmtUtils]: Removed 1 from assertion stack [2018-10-04 12:23:23,370 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:23:23,374 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:23:23,375 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:23:23 BoogieIcfgContainer [2018-10-04 12:23:23,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:23:23,376 INFO L168 Benchmark]: Toolchain (without parser) took 247042.45 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 343.6 MB). Peak memory consumption was 347.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:23:23,378 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:23:23,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:23:23,379 INFO L168 Benchmark]: Boogie Preprocessor took 22.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:23:23,379 INFO L168 Benchmark]: RCFGBuilder took 343.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:23:23,388 INFO L168 Benchmark]: TraceAbstraction took 246624.25 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.4 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:23:23,390 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 343.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246624.25 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.4 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 56). Cancelled while BasicCegarLoop was analyzing trace of length 363 with TraceHistMax 90, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 246.5s OverallTime, 90 OverallIterations, 90 TraceHistogramMax, 38.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 534 SDtfs, 7253 SDslu, 10076 SDs, 0 SdLazy, 10254 SolverSat, 7507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20198 GetRequests, 16193 SyntacticMatches, 0 SemanticMatches, 4005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363occurred in iteration=89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 89 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 85.6s SatisfiabilityAnalysisTime, 114.6s InterpolantComputationTime, 32390 NumberOfCodeBlocks, 32390 NumberOfCodeBlocksAsserted, 2128 NumberOfCheckSat, 32213 ConstructedInterpolants, 0 QuantifiedInterpolants, 15390013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 48488 ConjunctsInSsa, 4092 ConjunctsInUnsatCore, 177 InterpolantComputations, 1 PerfectInterpolantSequences, 469920/939840 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/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-23-23-407.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-23-23-407.csv Completed graceful shutdown