java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:50:41,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:50:41,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:50:41,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:50:41,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:50:41,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:50:41,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:50:41,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:50:41,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:50:41,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:50:41,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:50:41,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:50:41,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:50:41,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:50:41,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:50:41,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:50:41,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:50:41,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:50:41,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:50:41,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:50:41,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:50:41,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:50:41,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:50:41,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:50:41,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:50:41,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:50:41,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:50:41,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:50:41,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:50:41,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:50:41,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:50:41,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:50:41,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:50:41,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:50:41,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:50:41,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:50:41,278 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:50:41,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:50:41,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:50:41,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:50:41,294 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:50:41,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:50:41,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:50:41,295 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:50:41,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:50:41,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:50:41,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:50:41,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:50:41,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:50:41,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:50:41,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:50:41,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:50:41,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:50:41,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:50:41,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:41,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:50:41,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:50:41,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:50:41,299 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:50:41,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:50:41,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:50:41,300 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:50:41,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:50:41,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:50:41,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:50:41,393 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:50:41,393 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:50:41,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-09-23 19:50:41,395 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-09-23 19:50:41,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:50:41,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:50:41,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:41,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:50:41,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:50:41,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,524 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:50:41,524 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:50:41,525 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:50:41,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:41,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:50:41,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:50:41,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:50:41,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... [2018-09-23 19:50:41,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:50:41,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:50:41,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:50:41,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:50:41,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 19:50:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 19:50:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-23 19:50:41,907 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:50:41,908 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:41 BoogieIcfgContainer [2018-09-23 19:50:41,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:50:41,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:50:41,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:50:41,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:50:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:41" (1/2) ... [2018-09-23 19:50:41,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699f9bb6 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:50:41, skipping insertion in model container [2018-09-23 19:50:41,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:41" (2/2) ... [2018-09-23 19:50:41,917 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-09-23 19:50:41,928 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:50:41,936 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:50:42,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:50:42,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:50:42,024 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:50:42,024 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:50:42,025 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:50:42,025 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:50:42,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:50:42,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:50:42,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:50:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-23 19:50:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 19:50:42,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:42,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 19:50:42,054 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:42,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-23 19:50:42,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:42,294 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:50:42,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-23 19:50:42,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:50:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:50:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:42,312 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-23 19:50:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:42,375 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-23 19:50:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:50:42,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-23 19:50:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:42,390 INFO L225 Difference]: With dead ends: 17 [2018-09-23 19:50:42,390 INFO L226 Difference]: Without dead ends: 10 [2018-09-23 19:50:42,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-23 19:50:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-23 19:50:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 19:50:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-23 19:50:42,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-23 19:50:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:42,431 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-23 19:50:42,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:50:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-23 19:50:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:50:42,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:42,432 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 19:50:42,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:42,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-23 19:50:42,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:42,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:42,549 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:42,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:42,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:42,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:42,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:42,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:42,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:42,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-23 19:50:42,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:50:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:50:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:50:42,986 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-23 19:50:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:43,139 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-23 19:50:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:50:43,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-23 19:50:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:43,140 INFO L225 Difference]: With dead ends: 15 [2018-09-23 19:50:43,141 INFO L226 Difference]: Without dead ends: 14 [2018-09-23 19:50:43,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:50:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-23 19:50:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-23 19:50:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 19:50:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-23 19:50:43,146 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-23 19:50:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-23 19:50:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:50:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-23 19:50:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:50:43,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:43,148 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-23 19:50:43,148 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-23 19:50:43,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:43,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:43,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:50:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:43,339 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:43,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:43,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:43,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:43,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:43,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:43,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:43,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:43,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-23 19:50:43,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:50:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:50:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:50:43,647 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-23 19:50:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:43,745 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-23 19:50:43,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:50:43,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:50:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:43,748 INFO L225 Difference]: With dead ends: 19 [2018-09-23 19:50:43,748 INFO L226 Difference]: Without dead ends: 18 [2018-09-23 19:50:43,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:50:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-23 19:50:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-23 19:50:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 19:50:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-23 19:50:43,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-23 19:50:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:43,754 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-23 19:50:43,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:50:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-23 19:50:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:50:43,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:43,755 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-23 19:50:43,756 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:43,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-23 19:50:43,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:43,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:43,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:43,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:43,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 19:50:43,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:43,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:44,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:44,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:44,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-23 19:50:44,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:50:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:50:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:50:44,254 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-23 19:50:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:44,349 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-23 19:50:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:50:44,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-23 19:50:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:44,351 INFO L225 Difference]: With dead ends: 23 [2018-09-23 19:50:44,351 INFO L226 Difference]: Without dead ends: 22 [2018-09-23 19:50:44,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:50:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-23 19:50:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-23 19:50:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-23 19:50:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-23 19:50:44,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-23 19:50:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:44,358 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-23 19:50:44,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:50:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-23 19:50:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:50:44,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:44,359 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-23 19:50:44,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:44,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-23 19:50:44,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:44,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,473 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:44,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:44,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:44,504 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:44,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:44,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:44,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:44,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:44,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:44,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:44,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-23 19:50:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 19:50:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 19:50:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:50:44,949 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-23 19:50:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:45,021 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-23 19:50:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:50:45,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-23 19:50:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:45,023 INFO L225 Difference]: With dead ends: 27 [2018-09-23 19:50:45,023 INFO L226 Difference]: Without dead ends: 26 [2018-09-23 19:50:45,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:50:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-23 19:50:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-23 19:50:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 19:50:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-23 19:50:45,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-23 19:50:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:45,030 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-23 19:50:45,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 19:50:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-23 19:50:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 19:50:45,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:45,031 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-23 19:50:45,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:45,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-23 19:50:45,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:45,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:45,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:45,223 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 19:50:45,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:45,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:45,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:45,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:45,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 19:50:45,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:50:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:50:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:45,403 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-23 19:50:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:45,462 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-23 19:50:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:50:45,462 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-23 19:50:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:45,464 INFO L225 Difference]: With dead ends: 31 [2018-09-23 19:50:45,464 INFO L226 Difference]: Without dead ends: 30 [2018-09-23 19:50:45,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-23 19:50:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-23 19:50:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 19:50:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-23 19:50:45,470 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-23 19:50:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:45,470 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-23 19:50:45,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:50:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-23 19:50:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 19:50:45,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:45,472 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-23 19:50:45,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:45,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:45,473 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-23 19:50:45,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:45,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:45,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:45,761 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 19:50:45,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:45,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:45,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:45,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:45,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:45,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:45,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:50:45,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:50:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:50:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:50:45,985 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-23 19:50:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:46,098 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-23 19:50:46,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:50:46,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-23 19:50:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:46,100 INFO L225 Difference]: With dead ends: 35 [2018-09-23 19:50:46,101 INFO L226 Difference]: Without dead ends: 34 [2018-09-23 19:50:46,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:50:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-23 19:50:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-23 19:50:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-23 19:50:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-23 19:50:46,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-23 19:50:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:46,108 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-23 19:50:46,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:50:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-23 19:50:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-23 19:50:46,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:46,109 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-23 19:50:46,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:46,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-23 19:50:46,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:46,299 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:46,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:46,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:46,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:46,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:46,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:46,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-23 19:50:46,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:50:46,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:50:46,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:50:46,564 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-23 19:50:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:46,688 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-23 19:50:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:50:46,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-23 19:50:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:46,690 INFO L225 Difference]: With dead ends: 39 [2018-09-23 19:50:46,690 INFO L226 Difference]: Without dead ends: 38 [2018-09-23 19:50:46,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:50:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-23 19:50:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-23 19:50:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-23 19:50:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-23 19:50:46,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-23 19:50:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:46,697 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-23 19:50:46,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:50:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-23 19:50:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-23 19:50:46,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:46,698 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-23 19:50:46,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:46,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-23 19:50:46,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:46,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:46,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:46,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:46,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:46,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:46,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:46,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:46,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:46,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:46,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:47,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:47,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-23 19:50:47,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-23 19:50:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-23 19:50:47,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:50:47,143 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-23 19:50:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:47,423 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-23 19:50:47,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:50:47,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-23 19:50:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:47,424 INFO L225 Difference]: With dead ends: 43 [2018-09-23 19:50:47,424 INFO L226 Difference]: Without dead ends: 42 [2018-09-23 19:50:47,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:50:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-23 19:50:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-23 19:50:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 19:50:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-23 19:50:47,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-23 19:50:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:47,431 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-23 19:50:47,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-23 19:50:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-23 19:50:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 19:50:47,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:47,432 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-23 19:50:47,432 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:47,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-23 19:50:47,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:47,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:47,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:47,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:47,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:47,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:47,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:50:47,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:47,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:47,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:47,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:47,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:47,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:48,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:48,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-23 19:50:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:50:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:50:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:50:48,250 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-23 19:50:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:48,356 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-23 19:50:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:50:48,357 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-23 19:50:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:48,358 INFO L225 Difference]: With dead ends: 47 [2018-09-23 19:50:48,359 INFO L226 Difference]: Without dead ends: 46 [2018-09-23 19:50:48,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:50:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-23 19:50:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-23 19:50:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-23 19:50:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-23 19:50:48,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-23 19:50:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-23 19:50:48,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:50:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-23 19:50:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 19:50:48,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:48,368 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-23 19:50:48,368 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:48,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-23 19:50:48,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:48,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:48,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:48,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:48,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:48,681 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:48,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:48,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:48,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:48,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:48,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:48,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:49,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:49,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-23 19:50:49,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 19:50:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 19:50:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:50:49,014 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-23 19:50:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:49,123 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-23 19:50:49,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:50:49,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-23 19:50:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:49,126 INFO L225 Difference]: With dead ends: 51 [2018-09-23 19:50:49,126 INFO L226 Difference]: Without dead ends: 50 [2018-09-23 19:50:49,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:50:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-23 19:50:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-23 19:50:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-23 19:50:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-23 19:50:49,133 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-23 19:50:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:49,133 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-23 19:50:49,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 19:50:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-23 19:50:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-23 19:50:49,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:49,135 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-23 19:50:49,135 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:49,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-23 19:50:49,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:49,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:49,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:49,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:49,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:49,456 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:50:49,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:49,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:49,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:49,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:49,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:49,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:49,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:49,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-23 19:50:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 19:50:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 19:50:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:50:49,889 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-23 19:50:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:49,998 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-23 19:50:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:50:49,999 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-23 19:50:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:50,000 INFO L225 Difference]: With dead ends: 55 [2018-09-23 19:50:50,000 INFO L226 Difference]: Without dead ends: 54 [2018-09-23 19:50:50,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:50:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-23 19:50:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-23 19:50:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-23 19:50:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-23 19:50:50,007 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-23 19:50:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:50,008 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-23 19:50:50,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 19:50:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-23 19:50:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-23 19:50:50,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:50,009 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-23 19:50:50,009 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:50,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-23 19:50:50,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:50,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:50,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:50,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:50,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:50,489 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:50,518 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:50:50,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:50,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:50,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:50,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:50,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:50,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:50,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:50,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-23 19:50:50,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-23 19:50:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-23 19:50:50,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:50:50,924 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-23 19:50:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:51,045 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-23 19:50:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:50:51,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-23 19:50:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:51,047 INFO L225 Difference]: With dead ends: 59 [2018-09-23 19:50:51,047 INFO L226 Difference]: Without dead ends: 58 [2018-09-23 19:50:51,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:50:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-23 19:50:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-23 19:50:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-23 19:50:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-23 19:50:51,055 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-23 19:50:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:51,056 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-23 19:50:51,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-23 19:50:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-23 19:50:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-23 19:50:51,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:51,057 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-23 19:50:51,058 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:51,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-23 19:50:51,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:51,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:51,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:51,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:51,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:51,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:51,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:51,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:51,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:51,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:51,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-23 19:50:51,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 19:50:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 19:50:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:50:51,779 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-23 19:50:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:52,001 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-23 19:50:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:50:52,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-23 19:50:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:52,002 INFO L225 Difference]: With dead ends: 63 [2018-09-23 19:50:52,002 INFO L226 Difference]: Without dead ends: 62 [2018-09-23 19:50:52,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:50:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-23 19:50:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-23 19:50:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 19:50:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-23 19:50:52,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-23 19:50:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:52,009 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-23 19:50:52,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 19:50:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-23 19:50:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 19:50:52,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:52,010 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-23 19:50:52,010 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:52,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-23 19:50:52,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:52,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:52,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:52,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:52,903 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:52,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:52,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:52,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:52,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:52,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:52,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:53,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:53,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-23 19:50:53,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 19:50:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 19:50:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:50:53,298 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-23 19:50:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:53,425 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-23 19:50:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:50:53,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-23 19:50:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:53,427 INFO L225 Difference]: With dead ends: 67 [2018-09-23 19:50:53,427 INFO L226 Difference]: Without dead ends: 66 [2018-09-23 19:50:53,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:50:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-23 19:50:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-23 19:50:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-23 19:50:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-23 19:50:53,436 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-23 19:50:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:53,436 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-23 19:50:53,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 19:50:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-23 19:50:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-23 19:50:53,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:53,437 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-23 19:50:53,438 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:53,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-23 19:50:53,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:53,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:53,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:53,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:53,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:53,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:53,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:53,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 19:50:53,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:53,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:53,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:53,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:53,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:54,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:54,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-23 19:50:54,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 19:50:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 19:50:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:50:54,149 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-23 19:50:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:54,418 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-23 19:50:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:50:54,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-23 19:50:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:54,419 INFO L225 Difference]: With dead ends: 71 [2018-09-23 19:50:54,419 INFO L226 Difference]: Without dead ends: 70 [2018-09-23 19:50:54,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:50:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-23 19:50:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-23 19:50:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-23 19:50:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-23 19:50:54,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-23 19:50:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:54,431 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-23 19:50:54,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 19:50:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-23 19:50:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-23 19:50:54,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:54,433 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-23 19:50:54,433 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-23 19:50:54,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:54,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:54,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:54,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:54,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:54,993 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:54,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:54,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:55,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:55,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:55,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-23 19:50:55,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-23 19:50:55,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-23 19:50:55,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:50:55,396 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-23 19:50:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:55,506 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-23 19:50:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:50:55,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-23 19:50:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:55,507 INFO L225 Difference]: With dead ends: 75 [2018-09-23 19:50:55,507 INFO L226 Difference]: Without dead ends: 74 [2018-09-23 19:50:55,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:50:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-23 19:50:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-23 19:50:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-23 19:50:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-23 19:50:55,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-23 19:50:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:55,514 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-23 19:50:55,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-23 19:50:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-23 19:50:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-23 19:50:55,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:55,515 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-23 19:50:55,516 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:55,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-23 19:50:55,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:55,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:55,928 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:55,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:55,974 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-23 19:50:55,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:55,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:55,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:55,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:56,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-23 19:50:56,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 19:50:56,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 19:50:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:50:56,409 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-23 19:50:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:56,512 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-23 19:50:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:50:56,512 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-23 19:50:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:56,513 INFO L225 Difference]: With dead ends: 79 [2018-09-23 19:50:56,514 INFO L226 Difference]: Without dead ends: 78 [2018-09-23 19:50:56,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:50:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-23 19:50:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-23 19:50:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-23 19:50:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-23 19:50:56,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-23 19:50:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:56,519 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-23 19:50:56,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 19:50:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-23 19:50:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-23 19:50:56,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:56,521 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-23 19:50:56,521 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:56,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-23 19:50:56,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:56,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:57,012 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-23 19:50:57,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:57,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:57,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:57,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:57,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-23 19:50:57,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-23 19:50:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-23 19:50:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:50:57,458 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-23 19:50:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:57,627 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-23 19:50:57,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:50:57,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-23 19:50:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:57,628 INFO L225 Difference]: With dead ends: 83 [2018-09-23 19:50:57,628 INFO L226 Difference]: Without dead ends: 82 [2018-09-23 19:50:57,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:50:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-23 19:50:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-23 19:50:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 19:50:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-23 19:50:57,632 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-23 19:50:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:57,632 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-23 19:50:57,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-23 19:50:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-23 19:50:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 19:50:57,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:57,634 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-23 19:50:57,634 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:57,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-23 19:50:57,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:57,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,056 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:58,056 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:58,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:58,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:58,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:58,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:58,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-23 19:50:58,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 19:50:58,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 19:50:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:50:58,707 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-23 19:50:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:58,873 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-23 19:50:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-23 19:50:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:58,875 INFO L225 Difference]: With dead ends: 87 [2018-09-23 19:50:58,875 INFO L226 Difference]: Without dead ends: 86 [2018-09-23 19:50:58,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:50:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-23 19:50:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-23 19:50:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-23 19:50:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-23 19:50:58,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-23 19:50:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:58,882 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-23 19:50:58,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 19:50:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-23 19:50:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-23 19:50:58,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:58,883 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-23 19:50:58,883 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:58,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-23 19:50:58,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,774 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:59,774 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:59,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:59,807 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:59,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:59,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:59,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:59,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:00,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:00,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-23 19:51:00,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-23 19:51:00,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-23 19:51:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:51:00,201 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-23 19:51:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:00,367 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-23 19:51:00,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:51:00,367 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-23 19:51:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:00,369 INFO L225 Difference]: With dead ends: 91 [2018-09-23 19:51:00,369 INFO L226 Difference]: Without dead ends: 90 [2018-09-23 19:51:00,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:51:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-23 19:51:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-23 19:51:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-23 19:51:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-23 19:51:00,374 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-23 19:51:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:00,374 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-23 19:51:00,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-23 19:51:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-23 19:51:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-23 19:51:00,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:00,375 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-23 19:51:00,376 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:00,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-23 19:51:00,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:00,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:00,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:00,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:00,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-23 19:51:00,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:00,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:00,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:00,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:00,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:00,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:03,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:03,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-23 19:51:03,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 19:51:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 19:51:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:51:03,045 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-23 19:51:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:03,199 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-23 19:51:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:51:03,201 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-23 19:51:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:03,202 INFO L225 Difference]: With dead ends: 95 [2018-09-23 19:51:03,202 INFO L226 Difference]: Without dead ends: 94 [2018-09-23 19:51:03,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:51:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-23 19:51:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-23 19:51:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 19:51:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-23 19:51:03,206 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-23 19:51:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:03,206 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-23 19:51:03,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 19:51:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-23 19:51:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 19:51:03,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:03,207 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-23 19:51:03,207 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:03,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-23 19:51:03,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:03,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:03,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:03,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:03,746 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:03,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:03,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:03,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:03,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:03,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:03,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:04,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-23 19:51:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 19:51:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 19:51:04,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:51:04,199 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-23 19:51:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:04,364 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-23 19:51:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:51:04,364 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-23 19:51:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:04,366 INFO L225 Difference]: With dead ends: 99 [2018-09-23 19:51:04,366 INFO L226 Difference]: Without dead ends: 98 [2018-09-23 19:51:04,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:51:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-23 19:51:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-23 19:51:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-23 19:51:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-23 19:51:04,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-23 19:51:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:04,371 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-23 19:51:04,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 19:51:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-23 19:51:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 19:51:04,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:04,372 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-23 19:51:04,373 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:04,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-23 19:51:04,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:04,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:04,941 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-23 19:51:04,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:04,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:04,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:04,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:05,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:05,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:05,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:05,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-23 19:51:05,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 19:51:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 19:51:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:51:05,661 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-23 19:51:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:05,935 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-23 19:51:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 19:51:05,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-23 19:51:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:05,937 INFO L225 Difference]: With dead ends: 103 [2018-09-23 19:51:05,937 INFO L226 Difference]: Without dead ends: 102 [2018-09-23 19:51:05,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:51:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-23 19:51:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-23 19:51:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-23 19:51:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-23 19:51:05,942 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-23 19:51:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:05,943 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-23 19:51:05,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 19:51:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-23 19:51:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-23 19:51:05,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:05,944 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-23 19:51:05,944 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:05,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-23 19:51:05,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:05,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:05,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:05,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,398 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:06,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:06,476 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-23 19:51:06,476 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:06,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:06,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:06,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-23 19:51:06,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-23 19:51:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-23 19:51:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:51:06,986 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-23 19:51:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:07,181 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-23 19:51:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:51:07,181 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-23 19:51:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:07,182 INFO L225 Difference]: With dead ends: 107 [2018-09-23 19:51:07,182 INFO L226 Difference]: Without dead ends: 106 [2018-09-23 19:51:07,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:51:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-23 19:51:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-23 19:51:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-23 19:51:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-23 19:51:07,188 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-23 19:51:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:07,188 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-23 19:51:07,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-23 19:51:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-23 19:51:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-23 19:51:07,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:07,189 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-23 19:51:07,189 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:07,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-23 19:51:07,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:07,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:08,390 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:08,390 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:08,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:08,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:08,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:08,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:09,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:09,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-23 19:51:09,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-23 19:51:09,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-23 19:51:09,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:51:09,198 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-23 19:51:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:09,397 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-23 19:51:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:51:09,398 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-23 19:51:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:09,399 INFO L225 Difference]: With dead ends: 111 [2018-09-23 19:51:09,399 INFO L226 Difference]: Without dead ends: 110 [2018-09-23 19:51:09,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:51:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-23 19:51:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-23 19:51:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 19:51:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-23 19:51:09,404 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-23 19:51:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:09,404 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-23 19:51:09,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-23 19:51:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-23 19:51:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 19:51:09,405 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:09,405 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-23 19:51:09,405 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:09,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-23 19:51:09,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:09,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:09,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:09,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:09,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:09,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:09,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:09,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:09,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:09,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:09,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:09,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:10,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:10,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-23 19:51:10,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-23 19:51:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-23 19:51:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:10,568 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-23 19:51:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:10,785 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-23 19:51:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:51:10,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-23 19:51:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:10,787 INFO L225 Difference]: With dead ends: 115 [2018-09-23 19:51:10,787 INFO L226 Difference]: Without dead ends: 114 [2018-09-23 19:51:10,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-23 19:51:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-23 19:51:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 19:51:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-23 19:51:10,794 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-23 19:51:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:10,794 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-23 19:51:10,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-23 19:51:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-23 19:51:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-23 19:51:10,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:10,795 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-23 19:51:10,795 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:10,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-23 19:51:10,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:10,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:11,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:11,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:11,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:11,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-23 19:51:11,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:11,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:11,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:11,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:12,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:12,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-23 19:51:12,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 19:51:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 19:51:12,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:51:12,059 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-23 19:51:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:12,263 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-23 19:51:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:51:12,264 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-23 19:51:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:12,265 INFO L225 Difference]: With dead ends: 119 [2018-09-23 19:51:12,265 INFO L226 Difference]: Without dead ends: 118 [2018-09-23 19:51:12,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:51:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-23 19:51:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-23 19:51:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-23 19:51:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-23 19:51:12,271 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-23 19:51:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:12,271 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-23 19:51:12,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 19:51:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-23 19:51:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-23 19:51:12,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:12,272 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-23 19:51:12,272 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-23 19:51:12,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:13,098 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:13,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:13,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:13,144 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:13,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:13,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:13,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:13,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:13,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:13,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-23 19:51:13,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-23 19:51:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-23 19:51:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 19:51:13,901 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-23 19:51:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:14,103 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-23 19:51:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:51:14,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-23 19:51:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:14,105 INFO L225 Difference]: With dead ends: 123 [2018-09-23 19:51:14,105 INFO L226 Difference]: Without dead ends: 122 [2018-09-23 19:51:14,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 19:51:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-23 19:51:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-23 19:51:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-23 19:51:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-23 19:51:14,111 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-23 19:51:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:14,111 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-23 19:51:14,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-23 19:51:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-23 19:51:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-23 19:51:14,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:14,112 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-23 19:51:14,112 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:14,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:14,113 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-23 19:51:14,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:14,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:14,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:14,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:14,810 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-23 19:51:14,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:14,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:14,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:14,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:14,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:14,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:15,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:15,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-23 19:51:15,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 19:51:15,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 19:51:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:15,565 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-23 19:51:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:15,831 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-23 19:51:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:51:15,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-23 19:51:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:15,833 INFO L225 Difference]: With dead ends: 127 [2018-09-23 19:51:15,833 INFO L226 Difference]: Without dead ends: 126 [2018-09-23 19:51:15,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-23 19:51:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-23 19:51:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-23 19:51:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-23 19:51:15,838 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-23 19:51:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:15,838 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-23 19:51:15,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 19:51:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-23 19:51:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-23 19:51:15,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:15,839 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-23 19:51:15,839 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:15,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-23 19:51:15,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:16,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:16,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:16,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:16,615 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-23 19:51:16,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:16,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:16,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:16,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:17,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:17,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-23 19:51:17,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-23 19:51:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-23 19:51:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 19:51:17,311 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-23 19:51:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:17,519 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-23 19:51:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 19:51:17,520 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-23 19:51:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:17,521 INFO L225 Difference]: With dead ends: 131 [2018-09-23 19:51:17,521 INFO L226 Difference]: Without dead ends: 130 [2018-09-23 19:51:17,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 19:51:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-23 19:51:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-23 19:51:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-23 19:51:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-23 19:51:17,526 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-23 19:51:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:17,526 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-23 19:51:17,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-23 19:51:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-23 19:51:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-23 19:51:17,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:17,527 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-23 19:51:17,527 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-23 19:51:17,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:17,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:17,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:18,520 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:18,521 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:18,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:18,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:18,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:18,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:19,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:19,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-23 19:51:19,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-23 19:51:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-23 19:51:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:51:19,373 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-23 19:51:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:19,584 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-23 19:51:19,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-23 19:51:19,585 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-23 19:51:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:19,586 INFO L225 Difference]: With dead ends: 135 [2018-09-23 19:51:19,586 INFO L226 Difference]: Without dead ends: 134 [2018-09-23 19:51:19,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:51:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-23 19:51:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-23 19:51:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-23 19:51:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-23 19:51:19,592 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-23 19:51:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:19,593 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-23 19:51:19,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-23 19:51:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-23 19:51:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-23 19:51:19,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:19,594 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-23 19:51:19,594 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:19,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:19,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-23 19:51:19,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:19,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:20,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:20,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:20,337 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:20,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:20,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:20,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:20,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:20,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:20,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:21,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:21,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-23 19:51:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 19:51:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 19:51:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:21,554 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-23 19:51:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:21,779 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-23 19:51:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-23 19:51:21,779 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-23 19:51:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:21,781 INFO L225 Difference]: With dead ends: 139 [2018-09-23 19:51:21,781 INFO L226 Difference]: Without dead ends: 138 [2018-09-23 19:51:21,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-23 19:51:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-23 19:51:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-23 19:51:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-23 19:51:21,787 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-23 19:51:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:21,787 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-23 19:51:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 19:51:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-23 19:51:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-23 19:51:21,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:21,788 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-23 19:51:21,788 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-23 19:51:21,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:21,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:22,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:22,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:22,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:22,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-23 19:51:22,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:22,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:22,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:22,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:22,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:24,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:24,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-23 19:51:24,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 19:51:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 19:51:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:51:24,919 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-23 19:51:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:25,224 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-23 19:51:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-23 19:51:25,226 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-23 19:51:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:25,227 INFO L225 Difference]: With dead ends: 143 [2018-09-23 19:51:25,227 INFO L226 Difference]: Without dead ends: 142 [2018-09-23 19:51:25,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:51:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-23 19:51:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-23 19:51:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 19:51:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-23 19:51:25,233 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-23 19:51:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:25,233 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-23 19:51:25,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 19:51:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-23 19:51:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 19:51:25,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:25,234 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-23 19:51:25,234 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:25,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-23 19:51:25,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:25,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:25,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:25,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:25,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:26,016 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:26,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:26,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:26,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:26,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:26,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:26,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:27,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:27,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-23 19:51:27,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-23 19:51:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-23 19:51:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:51:27,112 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-23 19:51:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:27,503 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-23 19:51:27,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-23 19:51:27,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-23 19:51:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:27,505 INFO L225 Difference]: With dead ends: 147 [2018-09-23 19:51:27,505 INFO L226 Difference]: Without dead ends: 146 [2018-09-23 19:51:27,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:51:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-23 19:51:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-23 19:51:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-23 19:51:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-23 19:51:27,511 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-23 19:51:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:27,512 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-23 19:51:27,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-23 19:51:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-23 19:51:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-23 19:51:27,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:27,514 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-23 19:51:27,514 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:27,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-23 19:51:27,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:27,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:27,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:28,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:28,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:28,632 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-23 19:51:28,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:28,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:28,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:28,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:28,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:28,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:29,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:29,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-23 19:51:29,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 19:51:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 19:51:29,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:29,571 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-23 19:51:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:29,946 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-23 19:51:29,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:51:29,947 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-23 19:51:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:29,948 INFO L225 Difference]: With dead ends: 151 [2018-09-23 19:51:29,949 INFO L226 Difference]: Without dead ends: 150 [2018-09-23 19:51:29,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-23 19:51:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-23 19:51:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-23 19:51:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-23 19:51:29,954 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-23 19:51:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:29,954 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-23 19:51:29,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 19:51:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-23 19:51:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-23 19:51:29,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:29,955 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-23 19:51:29,956 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-23 19:51:29,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:29,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:30,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:30,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:30,932 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-23 19:51:30,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:30,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:30,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:30,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:31,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:31,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-23 19:51:31,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-23 19:51:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-23 19:51:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 19:51:31,871 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-23 19:51:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:32,165 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-23 19:51:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-23 19:51:32,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-23 19:51:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:32,167 INFO L225 Difference]: With dead ends: 155 [2018-09-23 19:51:32,168 INFO L226 Difference]: Without dead ends: 154 [2018-09-23 19:51:32,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 19:51:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-23 19:51:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-23 19:51:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-23 19:51:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-23 19:51:32,173 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-23 19:51:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:32,174 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-23 19:51:32,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-23 19:51:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-23 19:51:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-23 19:51:32,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:32,175 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-23 19:51:32,175 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-23 19:51:32,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:32,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:33,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:33,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:33,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:33,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:33,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:33,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:33,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:33,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:34,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:34,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-23 19:51:34,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-23 19:51:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-23 19:51:34,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:51:34,573 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-23 19:51:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:34,846 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-23 19:51:34,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 19:51:34,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-23 19:51:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:34,848 INFO L225 Difference]: With dead ends: 159 [2018-09-23 19:51:34,848 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 19:51:34,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:51:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 19:51:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-23 19:51:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-23 19:51:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-23 19:51:34,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-23 19:51:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:34,854 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-23 19:51:34,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-23 19:51:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-23 19:51:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-23 19:51:34,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:34,855 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-23 19:51:34,855 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:34,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-23 19:51:34,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:34,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:35,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:35,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:35,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:36,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:36,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:36,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:36,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:36,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:36,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:36,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:37,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:37,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-23 19:51:37,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-23 19:51:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-23 19:51:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:51:37,166 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-23 19:51:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:37,516 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-23 19:51:37,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 19:51:37,516 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-23 19:51:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:37,518 INFO L225 Difference]: With dead ends: 163 [2018-09-23 19:51:37,518 INFO L226 Difference]: Without dead ends: 162 [2018-09-23 19:51:37,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:51:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-23 19:51:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-23 19:51:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-23 19:51:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-23 19:51:37,524 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-23 19:51:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:37,524 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-23 19:51:37,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-23 19:51:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-23 19:51:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-23 19:51:37,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:37,525 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-23 19:51:37,526 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:37,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-23 19:51:37,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:37,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:38,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:38,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:38,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:38,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-23 19:51:38,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:38,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:38,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:38,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:38,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:38,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:39,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:39,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-23 19:51:39,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 19:51:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 19:51:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:51:39,887 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-23 19:51:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:40,330 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-23 19:51:40,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 19:51:40,330 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-23 19:51:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:40,331 INFO L225 Difference]: With dead ends: 167 [2018-09-23 19:51:40,332 INFO L226 Difference]: Without dead ends: 166 [2018-09-23 19:51:40,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:51:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-23 19:51:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-23 19:51:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-23 19:51:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-23 19:51:40,339 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-23 19:51:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:40,339 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-23 19:51:40,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 19:51:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-23 19:51:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-23 19:51:40,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:40,341 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-23 19:51:40,341 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:40,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-23 19:51:40,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:40,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:40,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:41,901 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:41,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:41,962 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:41,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:41,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:41,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:41,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:42,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:42,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:43,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:43,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-23 19:51:43,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 19:51:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 19:51:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:51:43,218 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-23 19:51:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:43,471 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-23 19:51:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:51:43,472 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-23 19:51:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:43,473 INFO L225 Difference]: With dead ends: 171 [2018-09-23 19:51:43,473 INFO L226 Difference]: Without dead ends: 170 [2018-09-23 19:51:43,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:51:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-23 19:51:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-23 19:51:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-23 19:51:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-23 19:51:43,479 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-23 19:51:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:43,479 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-23 19:51:43,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 19:51:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-23 19:51:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-23 19:51:43,480 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:43,480 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-23 19:51:43,481 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:43,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-23 19:51:43,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:43,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:43,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:43,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:43,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:44,727 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:44,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:44,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:44,905 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-23 19:51:44,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:44,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:44,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:44,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:46,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:46,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-23 19:51:46,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 19:51:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 19:51:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:51:46,196 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-23 19:51:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:46,527 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-23 19:51:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 19:51:46,528 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-23 19:51:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:46,529 INFO L225 Difference]: With dead ends: 175 [2018-09-23 19:51:46,529 INFO L226 Difference]: Without dead ends: 174 [2018-09-23 19:51:46,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:51:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-23 19:51:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-23 19:51:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-23 19:51:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-23 19:51:46,536 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-23 19:51:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:46,536 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-23 19:51:46,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 19:51:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-23 19:51:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-23 19:51:46,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:46,537 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-23 19:51:46,538 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:46,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-23 19:51:46,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:46,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:47,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:47,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:47,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:48,160 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-23 19:51:48,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:48,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:48,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:48,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:48,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:48,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:49,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:49,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-23 19:51:49,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-23 19:51:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-23 19:51:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 19:51:49,598 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-23 19:51:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:50,231 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-23 19:51:50,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-23 19:51:50,231 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-23 19:51:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:50,233 INFO L225 Difference]: With dead ends: 179 [2018-09-23 19:51:50,233 INFO L226 Difference]: Without dead ends: 178 [2018-09-23 19:51:50,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 19:51:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-23 19:51:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-23 19:51:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-23 19:51:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-23 19:51:50,240 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-23 19:51:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:50,240 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-23 19:51:50,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-23 19:51:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-23 19:51:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-23 19:51:50,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:50,242 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-23 19:51:50,242 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:50,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-23 19:51:50,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:50,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:50,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:51,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:51,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:51,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:51,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:51,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:51,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:51,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:51,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:53,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:53,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-23 19:51:53,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-23 19:51:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-23 19:51:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 19:51:53,077 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-23 19:51:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:53,366 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-23 19:51:53,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-23 19:51:53,367 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-23 19:51:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:53,368 INFO L225 Difference]: With dead ends: 183 [2018-09-23 19:51:53,368 INFO L226 Difference]: Without dead ends: 182 [2018-09-23 19:51:53,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 19:51:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-23 19:51:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-23 19:51:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-23 19:51:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-23 19:51:53,374 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-23 19:51:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:53,374 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-23 19:51:53,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-23 19:51:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-23 19:51:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-23 19:51:53,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:53,375 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-23 19:51:53,375 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:53,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-23 19:51:53,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:54,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:54,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:54,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:55,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:55,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:55,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:55,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:55,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:55,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:55,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:56,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:56,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-23 19:51:56,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 19:51:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 19:51:56,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:51:56,474 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-23 19:51:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:56,759 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-23 19:51:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-23 19:51:56,759 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-23 19:51:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:56,761 INFO L225 Difference]: With dead ends: 187 [2018-09-23 19:51:56,761 INFO L226 Difference]: Without dead ends: 186 [2018-09-23 19:51:56,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:51:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-23 19:51:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-23 19:51:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-23 19:51:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-23 19:51:56,766 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-23 19:51:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:56,766 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-23 19:51:56,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 19:51:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-23 19:51:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-23 19:51:56,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:56,767 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-23 19:51:56,768 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:56,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-23 19:51:56,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:57,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:57,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:58,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-23 19:51:58,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:58,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:58,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:58,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:58,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:58,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:59,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:59,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-23 19:51:59,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-23 19:51:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-23 19:51:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:51:59,747 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-23 19:52:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:00,063 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-23 19:52:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 19:52:00,064 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-23 19:52:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:00,065 INFO L225 Difference]: With dead ends: 191 [2018-09-23 19:52:00,065 INFO L226 Difference]: Without dead ends: 190 [2018-09-23 19:52:00,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:52:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-23 19:52:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-23 19:52:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-23 19:52:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-23 19:52:00,070 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-23 19:52:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:00,070 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-23 19:52:00,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-23 19:52:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-23 19:52:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-23 19:52:00,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:00,071 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-23 19:52:00,071 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:00,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-23 19:52:00,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:00,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:00,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:01,601 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:01,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:01,685 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:01,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:01,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:01,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:01,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:01,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:01,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:04,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:04,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-23 19:52:04,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-23 19:52:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-23 19:52:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:52:04,258 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-23 19:52:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:04,727 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-23 19:52:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 19:52:04,727 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-23 19:52:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:04,729 INFO L225 Difference]: With dead ends: 195 [2018-09-23 19:52:04,729 INFO L226 Difference]: Without dead ends: 194 [2018-09-23 19:52:04,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:52:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-23 19:52:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-23 19:52:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-23 19:52:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-23 19:52:04,735 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-23 19:52:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:04,735 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-23 19:52:04,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-23 19:52:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-23 19:52:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-23 19:52:04,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:04,736 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-23 19:52:04,736 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:04,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-23 19:52:04,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:04,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:06,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:06,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:06,637 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-23 19:52:06,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:06,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:06,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:06,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:06,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:06,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:08,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:08,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-23 19:52:08,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-23 19:52:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-23 19:52:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:52:08,247 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-23 19:52:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:08,578 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-23 19:52:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 19:52:08,579 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-23 19:52:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:08,580 INFO L225 Difference]: With dead ends: 199 [2018-09-23 19:52:08,580 INFO L226 Difference]: Without dead ends: 198 [2018-09-23 19:52:08,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:52:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-23 19:52:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-23 19:52:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-23 19:52:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-23 19:52:08,586 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-23 19:52:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:08,586 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-23 19:52:08,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-23 19:52:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-23 19:52:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-23 19:52:08,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:08,587 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-23 19:52:08,587 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:08,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-23 19:52:08,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:08,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:10,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:10,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:10,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-23 19:52:10,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:10,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:10,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:10,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:10,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:10,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:12,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:12,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-23 19:52:12,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 19:52:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 19:52:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:52:12,053 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-23 19:52:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:12,417 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-23 19:52:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:52:12,418 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-23 19:52:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:12,419 INFO L225 Difference]: With dead ends: 203 [2018-09-23 19:52:12,419 INFO L226 Difference]: Without dead ends: 202 [2018-09-23 19:52:12,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:52:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-23 19:52:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-23 19:52:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-23 19:52:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-23 19:52:12,425 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-23 19:52:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:12,425 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-23 19:52:12,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 19:52:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-23 19:52:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-23 19:52:12,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:12,426 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-23 19:52:12,426 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:12,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-23 19:52:12,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:12,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:13,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:13,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:13,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:13,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:13,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:13,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:13,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:13,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:15,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:15,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-23 19:52:15,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-23 19:52:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-23 19:52:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:52:15,641 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-23 19:52:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:15,975 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-23 19:52:15,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-23 19:52:15,976 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-23 19:52:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:15,977 INFO L225 Difference]: With dead ends: 207 [2018-09-23 19:52:15,978 INFO L226 Difference]: Without dead ends: 206 [2018-09-23 19:52:15,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:52:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-23 19:52:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-23 19:52:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-23 19:52:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-23 19:52:15,984 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-23 19:52:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:15,984 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-23 19:52:15,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-23 19:52:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-23 19:52:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-23 19:52:15,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:15,986 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-23 19:52:15,986 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:15,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-23 19:52:15,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:15,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:15,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:15,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:15,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:18,407 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:18,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:18,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:18,474 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:18,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:18,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:18,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:18,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:18,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:18,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:20,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:20,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-23 19:52:20,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-23 19:52:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-23 19:52:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:52:20,744 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-23 19:52:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:21,076 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-23 19:52:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 19:52:21,077 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-23 19:52:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:21,079 INFO L225 Difference]: With dead ends: 211 [2018-09-23 19:52:21,079 INFO L226 Difference]: Without dead ends: 210 [2018-09-23 19:52:21,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:52:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-23 19:52:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-23 19:52:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-23 19:52:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-23 19:52:21,084 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-23 19:52:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:21,085 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-23 19:52:21,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-23 19:52:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-23 19:52:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-23 19:52:21,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:21,086 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-23 19:52:21,086 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:21,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-23 19:52:21,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:21,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:21,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:22,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:22,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:22,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:23,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-23 19:52:23,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:23,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:23,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:23,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:23,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:23,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:24,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:24,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-23 19:52:24,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 19:52:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 19:52:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:52:24,788 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-23 19:52:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:25,157 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-23 19:52:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 19:52:25,157 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-23 19:52:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:25,159 INFO L225 Difference]: With dead ends: 215 [2018-09-23 19:52:25,160 INFO L226 Difference]: Without dead ends: 214 [2018-09-23 19:52:25,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:52:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-23 19:52:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-23 19:52:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-23 19:52:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-23 19:52:25,167 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-23 19:52:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:25,167 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-23 19:52:25,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 19:52:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-23 19:52:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-23 19:52:25,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:25,168 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-23 19:52:25,169 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:25,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-23 19:52:25,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:25,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:25,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:26,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:26,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:26,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:26,824 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:26,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:26,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:26,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:26,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:26,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:26,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:28,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:28,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-23 19:52:28,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-23 19:52:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-23 19:52:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:52:28,606 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-23 19:52:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:28,960 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-23 19:52:28,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-23 19:52:28,961 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-23 19:52:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:28,962 INFO L225 Difference]: With dead ends: 219 [2018-09-23 19:52:28,963 INFO L226 Difference]: Without dead ends: 218 [2018-09-23 19:52:28,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:52:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-23 19:52:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-23 19:52:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-23 19:52:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-23 19:52:28,967 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-23 19:52:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:28,967 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-23 19:52:28,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-23 19:52:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-23 19:52:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-23 19:52:28,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:28,969 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-23 19:52:28,969 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:28,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-23 19:52:28,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:28,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:30,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:30,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:31,094 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-23 19:52:31,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:31,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:31,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:31,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:32,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:32,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-23 19:52:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-23 19:52:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-23 19:52:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:52:32,918 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-23 19:52:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:33,297 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-23 19:52:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 19:52:33,297 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-23 19:52:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:33,299 INFO L225 Difference]: With dead ends: 223 [2018-09-23 19:52:33,299 INFO L226 Difference]: Without dead ends: 222 [2018-09-23 19:52:33,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:52:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-23 19:52:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-23 19:52:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-23 19:52:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-23 19:52:33,304 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-23 19:52:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-23 19:52:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-23 19:52:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-23 19:52:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-23 19:52:33,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:33,306 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-23 19:52:33,306 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:33,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-23 19:52:33,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:33,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:34,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:34,873 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:34,880 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:35,113 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-23 19:52:35,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:35,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:35,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:35,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:35,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:35,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:37,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:37,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-23 19:52:37,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-23 19:52:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-23 19:52:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 19:52:37,048 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-23 19:52:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:37,413 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-23 19:52:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 19:52:37,414 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-23 19:52:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:37,415 INFO L225 Difference]: With dead ends: 227 [2018-09-23 19:52:37,416 INFO L226 Difference]: Without dead ends: 226 [2018-09-23 19:52:37,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 19:52:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-23 19:52:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-23 19:52:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-23 19:52:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-23 19:52:37,420 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-23 19:52:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:37,420 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-23 19:52:37,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-23 19:52:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-23 19:52:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-23 19:52:37,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:37,421 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-23 19:52:37,422 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:37,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-23 19:52:37,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:37,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:37,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:37,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:37,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:39,012 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:39,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:39,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:39,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:39,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:39,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:39,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:41,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:41,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-23 19:52:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-23 19:52:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-23 19:52:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:52:41,188 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-23 19:52:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:41,601 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-23 19:52:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-23 19:52:41,601 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-23 19:52:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:41,603 INFO L225 Difference]: With dead ends: 231 [2018-09-23 19:52:41,603 INFO L226 Difference]: Without dead ends: 230 [2018-09-23 19:52:41,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:52:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-23 19:52:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-23 19:52:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-23 19:52:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-23 19:52:41,610 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-23 19:52:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:41,611 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-23 19:52:41,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-23 19:52:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-23 19:52:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-23 19:52:41,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:41,612 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-23 19:52:41,612 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:41,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-23 19:52:41,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:41,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:41,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:43,315 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:43,315 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:43,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:43,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:43,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:43,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:43,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:43,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:43,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:46,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:46,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-23 19:52:46,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 19:52:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 19:52:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:52:46,150 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-23 19:52:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:46,585 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-23 19:52:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 19:52:46,586 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-23 19:52:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:46,587 INFO L225 Difference]: With dead ends: 235 [2018-09-23 19:52:46,587 INFO L226 Difference]: Without dead ends: 234 [2018-09-23 19:52:46,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:52:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-23 19:52:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-23 19:52:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-23 19:52:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-23 19:52:46,593 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-23 19:52:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:46,593 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-23 19:52:46,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 19:52:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-23 19:52:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-23 19:52:46,594 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:46,595 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-23 19:52:46,595 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:46,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-23 19:52:46,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:46,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:48,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:48,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:48,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:48,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-23 19:52:48,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:48,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:48,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:48,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:48,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:48,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:51,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:51,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-23 19:52:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-23 19:52:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-23 19:52:51,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:52:51,075 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-23 19:52:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:51,494 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-23 19:52:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-23 19:52:51,494 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-23 19:52:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:51,496 INFO L225 Difference]: With dead ends: 239 [2018-09-23 19:52:51,496 INFO L226 Difference]: Without dead ends: 238 [2018-09-23 19:52:51,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:52:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-23 19:52:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-23 19:52:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-23 19:52:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-23 19:52:51,501 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-23 19:52:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:51,501 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-23 19:52:51,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-23 19:52:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-23 19:52:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-23 19:52:51,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:51,503 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-23 19:52:51,503 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:51,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-23 19:52:51,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:51,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:51,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:53,208 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:53,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:53,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:53,291 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:53,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:53,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:53,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:53,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:53,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:53,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:55,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:55,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-23 19:52:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-23 19:52:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-23 19:52:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 19:52:55,900 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-23 19:52:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:56,333 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-23 19:52:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-23 19:52:56,333 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-23 19:52:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:56,335 INFO L225 Difference]: With dead ends: 243 [2018-09-23 19:52:56,335 INFO L226 Difference]: Without dead ends: 242 [2018-09-23 19:52:56,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 19:52:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-23 19:52:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-23 19:52:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-23 19:52:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-23 19:52:56,341 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-23 19:52:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:56,341 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-23 19:52:56,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-23 19:52:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-23 19:52:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-23 19:52:56,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:56,342 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-23 19:52:56,342 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:56,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-23 19:52:56,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:56,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:56,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:58,366 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:58,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:58,550 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-23 19:52:58,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:58,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:58,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:58,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:58,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:58,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:00,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:00,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-23 19:53:00,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-23 19:53:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-23 19:53:00,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:53:00,940 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-23 19:53:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:01,354 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-23 19:53:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-23 19:53:01,354 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-23 19:53:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:01,356 INFO L225 Difference]: With dead ends: 247 [2018-09-23 19:53:01,356 INFO L226 Difference]: Without dead ends: 246 [2018-09-23 19:53:01,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:53:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-23 19:53:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-23 19:53:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-23 19:53:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-23 19:53:01,363 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-23 19:53:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:01,363 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-23 19:53:01,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-23 19:53:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-23 19:53:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-23 19:53:01,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:01,365 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-23 19:53:01,365 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:01,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-23 19:53:01,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:01,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:01,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:03,193 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:03,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:03,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:03,443 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-23 19:53:03,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:03,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:03,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:03,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:03,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:03,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:05,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:05,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-23 19:53:05,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-23 19:53:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-23 19:53:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 19:53:05,841 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-23 19:53:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:06,359 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-23 19:53:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-23 19:53:06,359 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-23 19:53:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:06,361 INFO L225 Difference]: With dead ends: 251 [2018-09-23 19:53:06,361 INFO L226 Difference]: Without dead ends: 250 [2018-09-23 19:53:06,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 19:53:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-23 19:53:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-23 19:53:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-23 19:53:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-23 19:53:06,368 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-23 19:53:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:06,368 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-23 19:53:06,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-23 19:53:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-23 19:53:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-23 19:53:06,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:06,370 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-23 19:53:06,370 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:06,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-23 19:53:06,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:06,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:06,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:06,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:06,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:08,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:08,357 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-09-23 19:53:08,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:08,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:08,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:08,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:08,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:08,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:10,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:10,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-23 19:53:10,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-23 19:53:10,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-23 19:53:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 19:53:10,824 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-23 19:53:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:11,298 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-23 19:53:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-23 19:53:11,299 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-23 19:53:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:11,301 INFO L225 Difference]: With dead ends: 255 [2018-09-23 19:53:11,301 INFO L226 Difference]: Without dead ends: 254 [2018-09-23 19:53:11,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 19:53:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-23 19:53:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-23 19:53:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-23 19:53:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-23 19:53:11,306 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-23 19:53:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-23 19:53:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-23 19:53:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-23 19:53:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-23 19:53:11,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:11,307 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-23 19:53:11,307 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:11,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-23 19:53:11,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:11,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:13,312 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:13,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 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-09-23 19:53:13,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:53:13,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:53:13,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:13,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:13,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:13,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:13,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:15,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:15,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-23 19:53:15,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-23 19:53:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-23 19:53:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 19:53:15,792 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-23 19:53:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:16,305 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-23 19:53:16,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-23 19:53:16,305 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-23 19:53:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:16,307 INFO L225 Difference]: With dead ends: 259 [2018-09-23 19:53:16,307 INFO L226 Difference]: Without dead ends: 258 [2018-09-23 19:53:16,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 19:53:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-23 19:53:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-23 19:53:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-23 19:53:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-23 19:53:16,312 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-23 19:53:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:16,312 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-23 19:53:16,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-23 19:53:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-23 19:53:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-23 19:53:16,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:16,313 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-23 19:53:16,314 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:16,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-23 19:53:16,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:16,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:16,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:18,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:18,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:53:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:53:18,685 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-23 19:53:18,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:18,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:18,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:18,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:18,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:18,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:21,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:21,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-23 19:53:21,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-23 19:53:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-23 19:53:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 19:53:21,453 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-23 19:53:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:21,919 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-23 19:53:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-23 19:53:21,919 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-23 19:53:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:21,921 INFO L225 Difference]: With dead ends: 263 [2018-09-23 19:53:21,921 INFO L226 Difference]: Without dead ends: 262 [2018-09-23 19:53:21,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 19:53:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-23 19:53:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-23 19:53:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-23 19:53:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-23 19:53:21,926 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-23 19:53:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:21,927 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-23 19:53:21,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-23 19:53:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-23 19:53:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-23 19:53:21,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:21,928 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-23 19:53:21,929 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:21,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-23 19:53:21,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:21,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:24,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:24,043 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-09-23 19:53:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:53:24,135 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:53:24,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:24,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:24,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:24,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:24,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:24,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:27,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:27,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-23 19:53:27,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-23 19:53:27,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-23 19:53:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:53:27,228 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-23 19:53:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:27,727 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-23 19:53:27,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-23 19:53:27,727 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-23 19:53:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:27,728 INFO L225 Difference]: With dead ends: 267 [2018-09-23 19:53:27,728 INFO L226 Difference]: Without dead ends: 266 [2018-09-23 19:53:27,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:53:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-23 19:53:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-23 19:53:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-23 19:53:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-23 19:53:27,735 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-23 19:53:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:27,736 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-23 19:53:27,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-23 19:53:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-23 19:53:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-23 19:53:27,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:27,737 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-23 19:53:27,738 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:27,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-23 19:53:27,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:27,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:27,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:27,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:27,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:29,898 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:29,898 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-09-23 19:53:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:53:30,108 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-23 19:53:30,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:30,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:30,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:30,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:30,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:30,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:33,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:33,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-23 19:53:33,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-23 19:53:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-23 19:53:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:53:33,022 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-23 19:53:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:33,536 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-23 19:53:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-23 19:53:33,536 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-23 19:53:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:33,538 INFO L225 Difference]: With dead ends: 271 [2018-09-23 19:53:33,538 INFO L226 Difference]: Without dead ends: 270 [2018-09-23 19:53:33,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:53:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-23 19:53:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-23 19:53:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-23 19:53:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-23 19:53:33,545 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-23 19:53:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:33,545 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-23 19:53:33,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-23 19:53:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-23 19:53:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-23 19:53:33,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:33,547 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-23 19:53:33,547 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:33,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-23 19:53:33,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:33,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:33,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:33,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:33,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:35,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:35,776 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-09-23 19:53:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:36,087 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-23 19:53:36,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:36,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:36,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:36,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:36,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:36,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:39,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:39,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-23 19:53:39,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-23 19:53:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-23 19:53:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 19:53:39,176 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-23 19:53:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:39,734 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-23 19:53:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 19:53:39,735 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-23 19:53:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:39,736 INFO L225 Difference]: With dead ends: 275 [2018-09-23 19:53:39,737 INFO L226 Difference]: Without dead ends: 274 [2018-09-23 19:53:39,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 19:53:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-23 19:53:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-23 19:53:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-23 19:53:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-23 19:53:39,741 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-23 19:53:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:39,741 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-23 19:53:39,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-23 19:53:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-23 19:53:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-23 19:53:39,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:39,743 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-23 19:53:39,743 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-23 19:53:39,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:39,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:42,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:42,198 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-09-23 19:53:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:42,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:42,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:42,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:42,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:42,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:45,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:45,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-23 19:53:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-23 19:53:45,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-23 19:53:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 19:53:45,120 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-23 19:53:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:45,566 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-23 19:53:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-23 19:53:45,566 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-23 19:53:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:45,568 INFO L225 Difference]: With dead ends: 279 [2018-09-23 19:53:45,568 INFO L226 Difference]: Without dead ends: 278 [2018-09-23 19:53:45,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 19:53:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-23 19:53:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-23 19:53:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-23 19:53:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-23 19:53:45,575 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-23 19:53:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:45,575 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-23 19:53:45,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-23 19:53:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-23 19:53:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-23 19:53:45,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:45,577 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-23 19:53:45,577 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:45,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-23 19:53:45,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:45,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:48,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:48,298 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-09-23 19:53:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:53:48,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:53:48,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:48,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:48,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:48,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:51,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:51,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-23 19:53:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-23 19:53:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-23 19:53:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 19:53:51,240 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-23 19:53:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:51,833 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-23 19:53:51,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-23 19:53:51,834 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-23 19:53:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:51,835 INFO L225 Difference]: With dead ends: 283 [2018-09-23 19:53:51,835 INFO L226 Difference]: Without dead ends: 282 [2018-09-23 19:53:51,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 19:53:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-23 19:53:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-23 19:53:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-23 19:53:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-23 19:53:51,840 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-23 19:53:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-23 19:53:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-23 19:53:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-23 19:53:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-23 19:53:51,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:51,842 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-23 19:53:51,842 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-23 19:53:51,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:51,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:51,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:54,280 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:54,280 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-09-23 19:53:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:53:54,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-23 19:53:54,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:54,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:54,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:54,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:54,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:54,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:57,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:57,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-23 19:53:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-23 19:53:57,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-23 19:53:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 19:53:57,779 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-23 19:53:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:58,268 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-23 19:53:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-23 19:53:58,269 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-23 19:53:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:58,271 INFO L225 Difference]: With dead ends: 287 [2018-09-23 19:53:58,271 INFO L226 Difference]: Without dead ends: 286 [2018-09-23 19:53:58,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 19:53:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-23 19:53:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-23 19:53:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-23 19:53:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-23 19:53:58,278 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-23 19:53:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:58,279 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-23 19:53:58,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-23 19:53:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-23 19:53:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-23 19:53:58,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:58,280 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-23 19:53:58,281 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:58,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-23 19:53:58,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:58,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:00,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:00,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:54:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:54:00,950 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:54:00,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:00,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:00,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:00,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:00,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:00,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:04,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:04,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-23 19:54:04,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-23 19:54:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-23 19:54:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 19:54:04,282 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-23 19:54:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:04,897 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-23 19:54:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-23 19:54:04,897 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-23 19:54:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:04,899 INFO L225 Difference]: With dead ends: 291 [2018-09-23 19:54:04,899 INFO L226 Difference]: Without dead ends: 290 [2018-09-23 19:54:04,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 19:54:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-23 19:54:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-23 19:54:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-23 19:54:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-23 19:54:04,906 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-23 19:54:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:04,906 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-23 19:54:04,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-23 19:54:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-23 19:54:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-23 19:54:04,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:04,907 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-23 19:54:04,908 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:04,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-23 19:54:04,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:04,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:04,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:07,789 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:07,789 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-09-23 19:54:07,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:54:08,041 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-23 19:54:08,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:08,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:08,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:08,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:08,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:08,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:11,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:11,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-23 19:54:11,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-23 19:54:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-23 19:54:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:54:11,169 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-23 19:54:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:11,713 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-23 19:54:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-23 19:54:11,714 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-23 19:54:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:11,715 INFO L225 Difference]: With dead ends: 295 [2018-09-23 19:54:11,716 INFO L226 Difference]: Without dead ends: 294 [2018-09-23 19:54:11,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:54:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-23 19:54:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-23 19:54:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-23 19:54:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-23 19:54:11,722 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-23 19:54:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:11,722 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-23 19:54:11,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-23 19:54:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-23 19:54:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-23 19:54:11,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:11,724 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-23 19:54:11,724 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:11,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:11,724 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-23 19:54:11,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:11,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:11,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:14,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:14,624 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-09-23 19:54:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:54:15,012 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-23 19:54:15,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:15,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:15,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:15,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:15,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:15,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:18,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:18,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-23 19:54:18,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-23 19:54:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-23 19:54:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 19:54:18,359 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-23 19:54:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:18,867 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-23 19:54:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-23 19:54:18,868 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-23 19:54:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:18,870 INFO L225 Difference]: With dead ends: 299 [2018-09-23 19:54:18,870 INFO L226 Difference]: Without dead ends: 298 [2018-09-23 19:54:18,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 19:54:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-23 19:54:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-23 19:54:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-23 19:54:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-23 19:54:18,876 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-23 19:54:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:18,876 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-23 19:54:18,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-23 19:54:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-23 19:54:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-23 19:54:18,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:18,877 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-23 19:54:18,877 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:18,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-23 19:54:18,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:18,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:21,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:21,786 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-09-23 19:54:21,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:54:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:21,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:21,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:21,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:21,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:21,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:25,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:25,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-23 19:54:25,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-23 19:54:25,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-23 19:54:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 19:54:25,230 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-23 19:54:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:25,700 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-23 19:54:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-23 19:54:25,701 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-23 19:54:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:25,703 INFO L225 Difference]: With dead ends: 303 [2018-09-23 19:54:25,703 INFO L226 Difference]: Without dead ends: 302 [2018-09-23 19:54:25,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 19:54:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-23 19:54:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-23 19:54:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-23 19:54:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-23 19:54:25,709 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-23 19:54:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:25,709 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-23 19:54:25,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-23 19:54:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-23 19:54:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-23 19:54:25,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:25,710 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-23 19:54:25,710 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:25,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-23 19:54:25,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:54:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:28,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:28,503 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-09-23 19:54:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:54:28,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:54:28,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:28,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:28,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:28,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:28,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:28,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:31,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:31,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-23 19:54:31,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-23 19:54:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-23 19:54:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 19:54:31,873 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-23 19:54:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:32,375 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-23 19:54:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-23 19:54:32,376 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-23 19:54:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:32,377 INFO L225 Difference]: With dead ends: 307 [2018-09-23 19:54:32,377 INFO L226 Difference]: Without dead ends: 306 [2018-09-23 19:54:32,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 19:54:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-23 19:54:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-23 19:54:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-23 19:54:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-23 19:54:32,384 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-23 19:54:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:32,384 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-23 19:54:32,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-23 19:54:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-23 19:54:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-23 19:54:32,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:32,386 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-23 19:54:32,386 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:32,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-23 19:54:32,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:32,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:32,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:35,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:35,197 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-09-23 19:54:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:54:35,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-23 19:54:35,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:35,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:35,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:35,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:35,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:35,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:39,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:39,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-23 19:54:39,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-23 19:54:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-23 19:54:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 19:54:39,028 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-23 19:54:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:39,556 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-23 19:54:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-23 19:54:39,556 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-23 19:54:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:39,558 INFO L225 Difference]: With dead ends: 311 [2018-09-23 19:54:39,558 INFO L226 Difference]: Without dead ends: 310 [2018-09-23 19:54:39,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 19:54:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-23 19:54:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-23 19:54:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-23 19:54:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-23 19:54:39,564 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-23 19:54:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:39,565 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-23 19:54:39,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-23 19:54:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-23 19:54:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-23 19:54:39,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:39,566 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-23 19:54:39,566 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:39,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-23 19:54:39,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:39,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-23 19:54:41,740 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:54:41,743 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:54:41,744 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:54:41 BoogieIcfgContainer [2018-09-23 19:54:41,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:54:41,744 INFO L168 Benchmark]: Toolchain (without parser) took 240271.07 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -471.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:41,746 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:41,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:41,746 INFO L168 Benchmark]: Boogie Preprocessor took 32.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:41,747 INFO L168 Benchmark]: RCFGBuilder took 330.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:54:41,747 INFO L168 Benchmark]: TraceAbstraction took 239834.55 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -493.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:41,749 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 330.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239834.55 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -493.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.7s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 4233 SDslu, 4299 SDs, 0 SdLazy, 15998 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 184.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 197.4s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-54-41-757.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-54-41-757.csv Completed graceful shutdown