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/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:57:06,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:57:06,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:57:06,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:57:06,506 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:57:06,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:57:06,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:57:06,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:57:06,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:57:06,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:57:06,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:57:06,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:57:06,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:57:06,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:57:06,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:57:06,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:57:06,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:57:06,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:57:06,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:57:06,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:57:06,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:57:06,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:57:06,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:57:06,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:57:06,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:57:06,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:57:06,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:57:06,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:57:06,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:57:06,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:57:06,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:57:06,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:57:06,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:57:06,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:57:06,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:57:06,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:57:06,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:57:06,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:57:06,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:57:06,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:57:06,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:57:06,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:57:06,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:57:06,577 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:57:06,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:57:06,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:57:06,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:57:06,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:57:06,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:57:06,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:57:06,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:57:06,579 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:57:06,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:57:06,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:57:06,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:57:06,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:57:06,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:57:06,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:57:06,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:57:06,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:57:06,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:57:06,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:57:06,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:57:06,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:57:06,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:57:06,655 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:57:06,655 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:57:06,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-10-02 11:57:06,657 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-02 11:57:06,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:57:06,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:57:06,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:57:06,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:57:06,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:57:06,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,750 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:57:06,750 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:57:06,751 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:57:06,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:57:06,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:57:06,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:57:06,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:57:06,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... [2018-10-02 11:57:06,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:57:06,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:57:06,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:57:06,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:57:06,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:57:06,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-02 11:57:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-02 11:57:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-02 11:57:07,044 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:57:07,044 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:07 BoogieIcfgContainer [2018-10-02 11:57:07,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:57:07,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:57:07,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:57:07,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:57:07,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:57:06" (1/2) ... [2018-10-02 11:57:07,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aef889 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:57:07, skipping insertion in model container [2018-10-02 11:57:07,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:07" (2/2) ... [2018-10-02 11:57:07,053 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-02 11:57:07,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:57:07,072 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:57:07,131 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:57:07,132 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:57:07,133 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:57:07,133 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:57:07,133 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:57:07,133 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:57:07,133 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:57:07,134 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:57:07,134 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:57:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-02 11:57:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-02 11:57:07,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:07,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-02 11:57:07,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:07,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-02 11:57:07,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:07,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:07,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:57:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 11:57:07,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:57:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:57:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:57:07,354 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-02 11:57:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:07,404 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 11:57:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:57:07,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-02 11:57:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:07,416 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:57:07,416 INFO L226 Difference]: Without dead ends: 4 [2018-10-02 11:57:07,420 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-10-02 11:57:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-02 11:57:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-02 11:57:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-02 11:57:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-02 11:57:07,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-02 11:57:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:07,454 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-02 11:57:07,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:57:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-02 11:57:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 11:57:07,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:07,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 11:57:07,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:07,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-02 11:57:07,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:07,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:07,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:07,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:07,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:07,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-02 11:57:07,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:57:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:57:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:57:07,805 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-02 11:57:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:07,928 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-02 11:57:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:57:07,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-02 11:57:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:07,929 INFO L225 Difference]: With dead ends: 6 [2018-10-02 11:57:07,930 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 11:57:07,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:57:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 11:57:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 11:57:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 11:57:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 11:57:07,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 11:57:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:07,933 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 11:57:07,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:57:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 11:57:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:57:07,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:07,934 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-02 11:57:07,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:07,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-02 11:57:07,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:07,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:08,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:08,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:08,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:08,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:08,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-02 11:57:08,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:57:08,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:57:08,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:57:08,299 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-02 11:57:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:08,370 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-02 11:57:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:57:08,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-02 11:57:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:08,373 INFO L225 Difference]: With dead ends: 7 [2018-10-02 11:57:08,374 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 11:57:08,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:57:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 11:57:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 11:57:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 11:57:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 11:57:08,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 11:57:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:08,378 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 11:57:08,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:57:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 11:57:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:57:08,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:08,379 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-02 11:57:08,379 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:08,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-02 11:57:08,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:08,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:08,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:08,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:08,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:08,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:08,613 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:57:08,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:08,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:08,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-02 11:57:08,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:57:08,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:57:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:57:08,830 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-02 11:57:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:08,876 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 11:57:08,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:57:08,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-02 11:57:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:08,878 INFO L225 Difference]: With dead ends: 8 [2018-10-02 11:57:08,879 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 11:57:08,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:57:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 11:57:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 11:57:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 11:57:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 11:57:08,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 11:57:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:08,886 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 11:57:08,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:57:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 11:57:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 11:57:08,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:08,887 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-02 11:57:08,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:08,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-02 11:57:08,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:08,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:08,986 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:08,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:09,015 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:09,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:09,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:09,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-02 11:57:09,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:57:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:57:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:57:09,252 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-02 11:57:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:09,347 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 11:57:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:57:09,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-02 11:57:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:09,348 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:57:09,348 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 11:57:09,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:57:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 11:57:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 11:57:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 11:57:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 11:57:09,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 11:57:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:09,353 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 11:57:09,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:57:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 11:57:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:57:09,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:09,354 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-02 11:57:09,355 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:09,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-02 11:57:09,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:09,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:09,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:09,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:09,524 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 11:57:09,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:09,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:10,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:10,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-02 11:57:10,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:57:10,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:57:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:57:10,068 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-02 11:57:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:10,180 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 11:57:10,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:57:10,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-02 11:57:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:10,181 INFO L225 Difference]: With dead ends: 10 [2018-10-02 11:57:10,181 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 11:57:10,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:57:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 11:57:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 11:57:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:57:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 11:57:10,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 11:57:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:10,186 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 11:57:10,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:57:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 11:57:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:57:10,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:10,187 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-02 11:57:10,187 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:10,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-02 11:57:10,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:10,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:10,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:10,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:10,337 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:10,346 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 11:57:10,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:10,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:10,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:10,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:57:10,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:57:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:57:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:57:10,551 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-02 11:57:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:11,002 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 11:57:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:57:11,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-02 11:57:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:11,003 INFO L225 Difference]: With dead ends: 11 [2018-10-02 11:57:11,003 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 11:57:11,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:57:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 11:57:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 11:57:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 11:57:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 11:57:11,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 11:57:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:11,007 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 11:57:11,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:57:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 11:57:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:57:11,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:11,008 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-02 11:57:11,008 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:11,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-02 11:57:11,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:11,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:11,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:11,354 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:11,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:11,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:11,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-02 11:57:11,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:57:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:57:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:57:11,695 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-02 11:57:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:11,826 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 11:57:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:57:11,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-02 11:57:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:11,827 INFO L225 Difference]: With dead ends: 12 [2018-10-02 11:57:11,827 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:57:11,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:57:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:57:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 11:57:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 11:57:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 11:57:11,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 11:57:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:11,832 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 11:57:11,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:57:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 11:57:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:57:11,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:11,833 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-02 11:57:11,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:11,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-02 11:57:11,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:11,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:11,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:12,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:12,182 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:12,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:12,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:12,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:12,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:12,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:12,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-02 11:57:12,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:57:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:57:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:57:12,531 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-02 11:57:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:12,652 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 11:57:12,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:57:12,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-02 11:57:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:12,654 INFO L225 Difference]: With dead ends: 13 [2018-10-02 11:57:12,655 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 11:57:12,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:57:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 11:57:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 11:57:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 11:57:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 11:57:12,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 11:57:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:12,659 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 11:57:12,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:57:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 11:57:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:57:12,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:12,660 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-02 11:57:12,660 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:12,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:12,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-02 11:57:12,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:12,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:12,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:12,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:12,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:13,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:13,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:13,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:13,096 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-02 11:57:13,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:13,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:13,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:13,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 11:57:13,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:57:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:57:13,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:57:13,597 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-02 11:57:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:13,836 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 11:57:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:57:13,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-02 11:57:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:13,837 INFO L225 Difference]: With dead ends: 14 [2018-10-02 11:57:13,837 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 11:57:13,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:57:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 11:57:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 11:57:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 11:57:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 11:57:13,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-02 11:57:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:13,841 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 11:57:13,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:57:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 11:57:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:57:13,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:13,842 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-02 11:57:13,843 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:13,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-02 11:57:13,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:13,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:14,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:14,239 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:14,259 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:14,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:14,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:14,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-02 11:57:14,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 11:57:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 11:57:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:57:14,984 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-02 11:57:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:15,171 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 11:57:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:57:15,171 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-02 11:57:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:15,172 INFO L225 Difference]: With dead ends: 15 [2018-10-02 11:57:15,173 INFO L226 Difference]: Without dead ends: 14 [2018-10-02 11:57:15,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:57:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-02 11:57:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-02 11:57:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-02 11:57:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-02 11:57:15,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-02 11:57:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:15,178 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-02 11:57:15,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 11:57:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-02 11:57:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:57:15,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:15,179 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-02 11:57:15,179 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:15,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-02 11:57:15,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:15,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:15,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:15,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:15,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:15,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:15,589 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-02 11:57:15,589 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:15,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:16,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:16,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-02 11:57:16,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 11:57:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 11:57:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:57:16,111 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-02 11:57:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:16,551 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-02 11:57:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:57:16,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-02 11:57:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:16,552 INFO L225 Difference]: With dead ends: 16 [2018-10-02 11:57:16,553 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 11:57:16,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:57:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 11:57:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 11:57:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 11:57:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 11:57:16,557 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-02 11:57:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:16,558 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-02 11:57:16,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 11:57:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 11:57:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:57:16,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:16,558 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-02 11:57:16,559 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:16,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-02 11:57:16,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:16,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:16,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:16,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:16,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:16,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:16,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:17,016 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 11:57:17,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:17,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:17,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-02 11:57:17,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 11:57:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 11:57:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:57:17,437 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-02 11:57:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:17,739 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-02 11:57:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:57:17,741 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-02 11:57:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:17,742 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:57:17,742 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 11:57:17,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:57:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 11:57:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 11:57:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 11:57:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-02 11:57:17,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-02 11:57:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:17,748 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-02 11:57:17,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 11:57:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-02 11:57:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:57:17,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:17,749 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-02 11:57:17,749 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:17,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-02 11:57:17,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:17,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:17,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:18,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:18,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:18,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:18,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:19,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:19,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-02 11:57:19,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 11:57:19,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 11:57:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:57:19,170 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-02 11:57:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:19,572 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-02 11:57:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:57:19,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-02 11:57:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:19,573 INFO L225 Difference]: With dead ends: 18 [2018-10-02 11:57:19,573 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:57:19,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:57:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:57:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 11:57:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:57:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 11:57:19,578 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-02 11:57:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 11:57:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 11:57:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 11:57:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:57:19,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:19,579 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-02 11:57:19,580 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-02 11:57:19,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:20,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:20,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:20,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:20,050 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:20,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:20,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:20,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-02 11:57:20,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 11:57:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 11:57:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:57:20,917 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-02 11:57:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:21,290 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 11:57:21,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:57:21,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-02 11:57:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:21,292 INFO L225 Difference]: With dead ends: 19 [2018-10-02 11:57:21,292 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 11:57:21,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:57:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 11:57:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-02 11:57:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-02 11:57:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-02 11:57:21,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-02 11:57:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:21,298 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-02 11:57:21,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 11:57:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-02 11:57:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:57:21,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:21,299 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-02 11:57:21,299 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:21,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:21,299 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-02 11:57:21,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:21,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:21,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:21,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:21,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:21,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:21,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-02 11:57:21,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:21,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:22,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:22,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-02 11:57:22,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 11:57:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 11:57:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:57:22,929 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-02 11:57:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:23,483 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-02 11:57:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:57:23,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-02 11:57:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:23,486 INFO L225 Difference]: With dead ends: 20 [2018-10-02 11:57:23,486 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 11:57:23,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:57:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 11:57:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 11:57:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 11:57:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 11:57:23,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-02 11:57:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:23,491 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-02 11:57:23,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 11:57:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 11:57:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:57:23,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:23,492 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-02 11:57:23,492 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:23,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-02 11:57:23,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:23,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:24,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:24,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:24,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:24,072 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:24,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:24,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-02 11:57:24,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 11:57:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 11:57:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-02 11:57:24,848 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-02 11:57:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:25,503 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 11:57:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:57:25,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-02 11:57:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:25,504 INFO L225 Difference]: With dead ends: 21 [2018-10-02 11:57:25,504 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 11:57:25,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-02 11:57:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 11:57:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 11:57:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 11:57:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-02 11:57:25,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-02 11:57:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:25,510 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-02 11:57:25,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 11:57:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-02 11:57:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:57:25,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:25,511 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-02 11:57:25,511 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-02 11:57:25,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:26,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:26,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:26,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:26,108 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-02 11:57:26,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:26,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:26,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-02 11:57:26,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 11:57:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 11:57:26,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:57:26,978 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-02 11:57:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:27,626 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-02 11:57:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:57:27,627 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-02 11:57:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:27,627 INFO L225 Difference]: With dead ends: 22 [2018-10-02 11:57:27,628 INFO L226 Difference]: Without dead ends: 21 [2018-10-02 11:57:27,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:57:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-02 11:57:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-02 11:57:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 11:57:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 11:57:27,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-02 11:57:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:27,634 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 11:57:27,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 11:57:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 11:57:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:57:27,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:27,635 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-02 11:57:27,636 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:27,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-02 11:57:27,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:27,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:27,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:28,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:28,182 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:28,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:28,216 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-02 11:57:28,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:28,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:29,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:29,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-02 11:57:29,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 11:57:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 11:57:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:57:29,491 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-02 11:57:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:30,236 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 11:57:30,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:57:30,237 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-02 11:57:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:30,237 INFO L225 Difference]: With dead ends: 23 [2018-10-02 11:57:30,238 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 11:57:30,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:57:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 11:57:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 11:57:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 11:57:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-02 11:57:30,244 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-02 11:57:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:30,244 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-02 11:57:30,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 11:57:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-02 11:57:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:57:30,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:30,245 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-02 11:57:30,246 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:30,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:30,246 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-02 11:57:30,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:30,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:30,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:30,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:30,837 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:30,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:32,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:32,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-02 11:57:32,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 11:57:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 11:57:32,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-02 11:57:32,144 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-02 11:57:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:33,061 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-02 11:57:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:57:33,061 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-02 11:57:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:33,062 INFO L225 Difference]: With dead ends: 24 [2018-10-02 11:57:33,062 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 11:57:33,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-02 11:57:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 11:57:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 11:57:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 11:57:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 11:57:33,070 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-02 11:57:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:33,070 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-02 11:57:33,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 11:57:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 11:57:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:57:33,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:33,071 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-02 11:57:33,072 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:33,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-02 11:57:33,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:33,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:33,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:33,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:33,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:33,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:34,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:35,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-02 11:57:35,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 11:57:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 11:57:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:57:35,375 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-02 11:57:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:36,262 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-02 11:57:36,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:57:36,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-02 11:57:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:36,263 INFO L225 Difference]: With dead ends: 25 [2018-10-02 11:57:36,263 INFO L226 Difference]: Without dead ends: 24 [2018-10-02 11:57:36,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:57:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-02 11:57:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-02 11:57:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 11:57:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-02 11:57:36,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-02 11:57:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-02 11:57:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 11:57:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-02 11:57:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:57:36,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:36,269 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-02 11:57:36,269 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:36,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-02 11:57:36,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:37,078 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:37,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-02 11:57:37,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:37,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:38,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:38,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-02 11:57:38,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 11:57:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 11:57:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:57:38,929 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-02 11:57:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:39,841 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-02 11:57:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:57:39,844 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-02 11:57:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:39,845 INFO L225 Difference]: With dead ends: 26 [2018-10-02 11:57:39,845 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 11:57:39,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:57:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 11:57:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-02 11:57:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 11:57:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 11:57:39,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-02 11:57:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 11:57:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 11:57:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 11:57:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:57:39,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:39,852 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-02 11:57:39,852 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:39,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-02 11:57:39,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:39,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:41,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:41,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:41,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:41,553 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:41,554 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:41,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:43,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:43,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-02 11:57:43,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 11:57:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 11:57:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-02 11:57:43,198 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-02 11:57:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:44,359 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 11:57:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:57:44,360 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-02 11:57:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:44,361 INFO L225 Difference]: With dead ends: 27 [2018-10-02 11:57:44,361 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 11:57:44,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-02 11:57:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 11:57:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 11:57:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 11:57:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-02 11:57:44,366 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-02 11:57:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-02 11:57:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 11:57:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-02 11:57:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:57:44,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:44,368 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-02 11:57:44,368 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:44,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-02 11:57:44,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:44,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:45,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:45,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:45,268 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:45,301 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-02 11:57:45,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:45,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:47,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:47,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-02 11:57:47,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 11:57:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 11:57:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:57:47,072 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-02 11:57:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:48,734 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-02 11:57:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:57:48,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-02 11:57:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:48,735 INFO L225 Difference]: With dead ends: 28 [2018-10-02 11:57:48,735 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 11:57:48,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:57:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 11:57:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 11:57:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:57:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 11:57:48,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-02 11:57:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:48,740 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 11:57:48,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 11:57:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 11:57:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:57:48,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:48,741 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-02 11:57:48,741 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:48,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-02 11:57:48,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:48,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:48,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:49,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:49,793 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:49,800 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:49,852 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 11:57:49,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:49,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-02 11:57:52,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 11:57:52,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 11:57:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-02 11:57:52,069 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-02 11:57:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:53,293 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-02 11:57:53,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:57:53,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-02 11:57:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:53,294 INFO L225 Difference]: With dead ends: 29 [2018-10-02 11:57:53,294 INFO L226 Difference]: Without dead ends: 28 [2018-10-02 11:57:53,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-02 11:57:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-02 11:57:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-02 11:57:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-02 11:57:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-02 11:57:53,301 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-02 11:57:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:53,301 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-02 11:57:53,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 11:57:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-02 11:57:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-02 11:57:53,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:53,302 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-02 11:57:53,302 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:53,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-02 11:57:53,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:53,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:53,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:54,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:54,487 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:54,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:54,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:58,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:58,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-02 11:57:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 11:57:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 11:57:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-02 11:57:58,068 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-02 11:57:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:59,427 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-02 11:57:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:57:59,428 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-02 11:57:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:59,429 INFO L225 Difference]: With dead ends: 30 [2018-10-02 11:57:59,429 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 11:57:59,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-02 11:57:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 11:57:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-02 11:57:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:57:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 11:57:59,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-02 11:57:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:59,437 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 11:57:59,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 11:57:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 11:57:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 11:57:59,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:59,438 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-02 11:57:59,438 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:59,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-02 11:57:59,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:59,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:59,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:59,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:59,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:00,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:00,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:58:00,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:58:00,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:00,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-02 11:58:03,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 11:58:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 11:58:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:58:03,203 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-02 11:58:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:05,258 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 11:58:05,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:58:05,259 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-02 11:58:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:05,259 INFO L225 Difference]: With dead ends: 31 [2018-10-02 11:58:05,260 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 11:58:05,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:58:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 11:58:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-02 11:58:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 11:58:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-02 11:58:05,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-02 11:58:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:05,265 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-02 11:58:05,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 11:58:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-02 11:58:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:58:05,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:05,266 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-02 11:58:05,266 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:05,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-02 11:58:05,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:05,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:05,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:07,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:07,089 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:58:07,142 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-02 11:58:07,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:07,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:09,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-02 11:58:09,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 11:58:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 11:58:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-02 11:58:09,948 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-02 11:58:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:12,241 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-02 11:58:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:58:12,241 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-02 11:58:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:12,242 INFO L225 Difference]: With dead ends: 32 [2018-10-02 11:58:12,242 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 11:58:12,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-02 11:58:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 11:58:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 11:58:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 11:58:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 11:58:12,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-02 11:58:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:12,249 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-02 11:58:12,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-02 11:58:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 11:58:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:58:12,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:12,250 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-02 11:58:12,250 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:12,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:12,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-02 11:58:12,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:12,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:12,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:13,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:13,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:13,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:58:13,673 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:58:13,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:13,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:16,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:16,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-02 11:58:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-02 11:58:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-02 11:58:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-02 11:58:16,711 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-02 11:58:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:18,889 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-02 11:58:18,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:58:18,890 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-02 11:58:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:18,890 INFO L225 Difference]: With dead ends: 33 [2018-10-02 11:58:18,890 INFO L226 Difference]: Without dead ends: 32 [2018-10-02 11:58:18,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-02 11:58:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-02 11:58:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-02 11:58:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-02 11:58:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-02 11:58:18,898 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-02 11:58:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:18,898 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-02 11:58:18,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-02 11:58:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-02 11:58:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:58:18,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:18,899 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-02 11:58:18,900 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-02 11:58:18,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:18,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:20,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:20,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:58:20,638 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-02 11:58:20,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:20,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:23,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-02 11:58:23,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-02 11:58:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-02 11:58:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:58:23,855 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-02 11:58:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:25,745 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-02 11:58:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:58:25,746 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-02 11:58:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:25,747 INFO L225 Difference]: With dead ends: 34 [2018-10-02 11:58:25,747 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:58:25,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:58:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:58:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 11:58:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:58:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 11:58:25,753 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-02 11:58:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:25,753 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 11:58:25,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-02 11:58:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 11:58:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 11:58:25,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:25,754 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-02 11:58:25,754 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:25,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-02 11:58:25,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:25,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:25,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:27,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:27,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:58:27,635 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-02 11:58:27,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:27,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:31,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-02 11:58:31,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-02 11:58:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-02 11:58:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-02 11:58:31,235 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-02 11:58:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:33,624 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 11:58:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 11:58:33,624 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-02 11:58:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:33,625 INFO L225 Difference]: With dead ends: 35 [2018-10-02 11:58:33,625 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 11:58:33,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-02 11:58:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 11:58:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 11:58:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 11:58:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-02 11:58:33,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-02 11:58:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:33,631 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-02 11:58:33,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-02 11:58:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-02 11:58:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:58:33,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:33,631 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-02 11:58:33,632 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:33,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-02 11:58:33,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:35,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:35,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:35,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:35,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:39,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-02 11:58:39,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-02 11:58:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-02 11:58:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=3506, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:58:39,933 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-02 11:58:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:42,765 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-02 11:58:42,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:58:42,766 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-02 11:58:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:42,767 INFO L225 Difference]: With dead ends: 36 [2018-10-02 11:58:42,767 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 11:58:42,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=654, Invalid=3506, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:58:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 11:58:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 11:58:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 11:58:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 11:58:42,772 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-02 11:58:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:42,772 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-02 11:58:42,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-02 11:58:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 11:58:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:58:42,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:42,773 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-02 11:58:42,773 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:42,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-02 11:58:42,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:42,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:44,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:44,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:44,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:58:44,765 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:58:44,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:44,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-02 11:58:48,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-02 11:58:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-02 11:58:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-02 11:58:48,872 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-02 11:58:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:52,391 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-02 11:58:52,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 11:58:52,392 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-02 11:58:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:52,393 INFO L225 Difference]: With dead ends: 37 [2018-10-02 11:58:52,393 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 11:58:52,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-02 11:58:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 11:58:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 11:58:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 11:58:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-02 11:58:52,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-02 11:58:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:52,399 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-02 11:58:52,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-02 11:58:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-02 11:58:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 11:58:52,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:52,400 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-02 11:58:52,400 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:52,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-02 11:58:52,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:52,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:54,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:54,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:54,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:58:54,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-02 11:58:54,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:54,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:59,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:59,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-02 11:58:59,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-02 11:58:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-02 11:58:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:58:59,105 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-02 11:59:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:59:02,188 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-02 11:59:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 11:59:02,189 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-02 11:59:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:59:02,189 INFO L225 Difference]: With dead ends: 38 [2018-10-02 11:59:02,189 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:59:02,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:59:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:59:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 11:59:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:59:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 11:59:02,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-02 11:59:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:59:02,197 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 11:59:02,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-02 11:59:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 11:59:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:59:02,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:59:02,198 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-02 11:59:02,198 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:59:02,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:59:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-02 11:59:02,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:59:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:59:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:02,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:59:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:04,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:59:04,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:59:04,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:59:04,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:59:04,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:59:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:09,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:59:09,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-02 11:59:09,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-02 11:59:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-02 11:59:09,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2018-10-02 11:59:09,470 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-02 11:59:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:59:13,353 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 11:59:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 11:59:13,354 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-02 11:59:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:59:13,354 INFO L225 Difference]: With dead ends: 39 [2018-10-02 11:59:13,354 INFO L226 Difference]: Without dead ends: 38 [2018-10-02 11:59:13,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2018-10-02 11:59:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-02 11:59:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-02 11:59:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 11:59:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-02 11:59:13,359 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-02 11:59:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:59:13,359 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-02 11:59:13,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-02 11:59:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-02 11:59:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 11:59:13,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:59:13,360 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-02 11:59:13,360 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:59:13,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:59:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-02 11:59:13,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:59:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:59:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:13,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:59:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:15,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:59:15,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:15,883 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:59:15,958 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-02 11:59:15,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:59:15,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:59:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:21,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:59:21,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-02 11:59:21,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-02 11:59:21,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-02 11:59:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:59:21,352 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-02 11:59:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:59:24,986 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-02 11:59:24,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 11:59:24,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-02 11:59:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:59:24,987 INFO L225 Difference]: With dead ends: 40 [2018-10-02 11:59:24,987 INFO L226 Difference]: Without dead ends: 39 [2018-10-02 11:59:24,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:59:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-02 11:59:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-02 11:59:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-02 11:59:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-02 11:59:24,993 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-02 11:59:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:59:24,993 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-02 11:59:24,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-02 11:59:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-02 11:59:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 11:59:24,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:59:24,994 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-02 11:59:24,994 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:59:24,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:59:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-02 11:59:24,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:59:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:59:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:24,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:59:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:27,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:59:27,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:59:27,807 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 11:59:27,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:59:27,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:59:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:33,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:59:33,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-02 11:59:33,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-02 11:59:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-02 11:59:33,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-02 11:59:33,543 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-02 11:59:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:59:38,287 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-02 11:59:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:59:38,287 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-02 11:59:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:59:38,288 INFO L225 Difference]: With dead ends: 41 [2018-10-02 11:59:38,288 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 11:59:38,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-02 11:59:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 11:59:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 11:59:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 11:59:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-02 11:59:38,293 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-02 11:59:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:59:38,293 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-02 11:59:38,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-02 11:59:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-02 11:59:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 11:59:38,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:59:38,294 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-02 11:59:38,294 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:59:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:59:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-02 11:59:38,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:59:38,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:59:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:38,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:59:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:41,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:59:41,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:41,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:59:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:41,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:59:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:47,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:59:47,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-02 11:59:47,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-02 11:59:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-02 11:59:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-02 11:59:47,369 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-02 11:59:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:59:52,069 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-02 11:59:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:59:52,070 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-02 11:59:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:59:52,071 INFO L225 Difference]: With dead ends: 42 [2018-10-02 11:59:52,071 INFO L226 Difference]: Without dead ends: 41 [2018-10-02 11:59:52,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-02 11:59:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-02 11:59:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-02 11:59:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-02 11:59:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-02 11:59:52,075 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-02 11:59:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:59:52,075 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-02 11:59:52,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-02 11:59:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-02 11:59:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-02 11:59:52,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:59:52,076 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-02 11:59:52,076 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:59:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:59:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-02 11:59:52,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:59:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:59:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:59:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:59:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:59:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:59:55,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:59:55,195 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:59:55,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:59:55,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:59:55,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:00:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:01,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:00:01,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-02 12:00:01,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-02 12:00:01,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-02 12:00:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 12:00:01,959 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-02 12:00:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:00:06,635 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-02 12:00:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 12:00:06,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-02 12:00:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:00:06,636 INFO L225 Difference]: With dead ends: 43 [2018-10-02 12:00:06,637 INFO L226 Difference]: Without dead ends: 42 [2018-10-02 12:00:06,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 12:00:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-02 12:00:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-02 12:00:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-02 12:00:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-02 12:00:06,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-02 12:00:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:00:06,641 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-02 12:00:06,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-02 12:00:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-02 12:00:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 12:00:06,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:00:06,642 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-02 12:00:06,642 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:00:06,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:00:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-02 12:00:06,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:00:06,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:00:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:06,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:00:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:00:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:09,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:00:09,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:00:09,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:00:10,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-02 12:00:10,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:00:10,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:00:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:17,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:00:17,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-02 12:00:17,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-02 12:00:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-02 12:00:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-02 12:00:17,337 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-02 12:00:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:00:21,951 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-02 12:00:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 12:00:21,952 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-02 12:00:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:00:21,953 INFO L225 Difference]: With dead ends: 44 [2018-10-02 12:00:21,953 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:00:21,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-02 12:00:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:00:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-02 12:00:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 12:00:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-02 12:00:21,958 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-02 12:00:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:00:21,958 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-02 12:00:21,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-02 12:00:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-02 12:00:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 12:00:21,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:00:21,959 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-02 12:00:21,959 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:00:21,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:00:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-02 12:00:21,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:00:21,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:00:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:21,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:00:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:00:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:25,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:00:25,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:00:25,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:00:25,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:00:25,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:00:25,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:00:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:33,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:00:33,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-02 12:00:33,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-02 12:00:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-02 12:00:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-02 12:00:33,450 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-02 12:00:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:00:37,973 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-02 12:00:37,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 12:00:37,973 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-02 12:00:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:00:37,974 INFO L225 Difference]: With dead ends: 45 [2018-10-02 12:00:37,974 INFO L226 Difference]: Without dead ends: 44 [2018-10-02 12:00:37,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-02 12:00:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-02 12:00:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-02 12:00:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-02 12:00:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-02 12:00:37,979 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-02 12:00:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:00:37,979 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-02 12:00:37,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-02 12:00:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-02 12:00:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-02 12:00:37,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:00:37,980 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-02 12:00:37,980 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:00:37,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:00:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-02 12:00:37,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:00:37,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:00:37,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:37,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:00:37,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:00:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:41,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:00:41,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:00:41,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:00:41,956 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-02 12:00:41,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:00:42,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:00:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:00:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-02 12:00:50,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-02 12:00:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-02 12:00:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-02 12:00:50,309 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-02 12:00:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:00:55,292 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-02 12:00:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 12:00:55,293 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-02 12:00:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:00:55,293 INFO L225 Difference]: With dead ends: 46 [2018-10-02 12:00:55,294 INFO L226 Difference]: Without dead ends: 45 [2018-10-02 12:00:55,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-02 12:00:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-02 12:00:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-02 12:00:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-02 12:00:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-02 12:00:55,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-02 12:00:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:00:55,300 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-02 12:00:55,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-02 12:00:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-02 12:00:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 12:00:55,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:00:55,301 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-02 12:00:55,301 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:00:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:00:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-02 12:00:55,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:00:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:00:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:55,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:00:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:00:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:00:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:00:59,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:00:59,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:00:59,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:00:59,696 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-02 12:00:59,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:00:59,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:01:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:01:08,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:01:08,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-02 12:01:08,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-02 12:01:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-02 12:01:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-02 12:01:08,726 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-02 12:01:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:01:13,980 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-02 12:01:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 12:01:13,981 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-02 12:01:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:01:13,982 INFO L225 Difference]: With dead ends: 47 [2018-10-02 12:01:13,982 INFO L226 Difference]: Without dead ends: 46 [2018-10-02 12:01:13,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-02 12:01:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-02 12:01:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-02 12:01:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-02 12:01:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-02 12:01:13,987 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-02 12:01:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:01:13,987 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-02 12:01:13,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-02 12:01:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-02 12:01:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 12:01:13,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:01:13,988 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-02 12:01:13,988 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:01:13,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:01:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-02 12:01:13,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:01:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:01:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:01:13,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:01:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:01:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:01:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:01:18,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:01:18,392 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:01:18,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:01:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:01:18,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:01:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:01:28,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:01:28,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-02 12:01:28,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-02 12:01:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-02 12:01:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=6668, Unknown=0, NotChecked=0, Total=7832 [2018-10-02 12:01:28,239 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. [2018-10-02 12:01:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:01:34,111 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-02 12:01:34,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 12:01:34,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 45 [2018-10-02 12:01:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:01:34,113 INFO L225 Difference]: With dead ends: 48 [2018-10-02 12:01:34,113 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 12:01:34,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1164, Invalid=6668, Unknown=0, NotChecked=0, Total=7832 [2018-10-02 12:01:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 12:01:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 12:01:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 12:01:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-02 12:01:34,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-02 12:01:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:01:34,119 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-02 12:01:34,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-02 12:01:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-02 12:01:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 12:01:34,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:01:34,120 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-02 12:01:34,120 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:01:34,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:01:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-02 12:01:34,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:01:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:01:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:01:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:01:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:01:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-02 12:01:35,015 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:01:35,018 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:01:35,019 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:01:35 BoogieIcfgContainer [2018-10-02 12:01:35,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:01:35,020 INFO L168 Benchmark]: Toolchain (without parser) took 268310.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 262.6 MB). Peak memory consumption was 320.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:01:35,022 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:01:35,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:01:35,022 INFO L168 Benchmark]: Boogie Preprocessor took 18.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:01:35,023 INFO L168 Benchmark]: RCFGBuilder took 272.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:01:35,023 INFO L168 Benchmark]: TraceAbstraction took 267973.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 241.5 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:01:35,026 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.23 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 40.53 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 18.37 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 272.13 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 267973.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 241.5 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 47 with TraceHistMax 44, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 267.8s OverallTime, 45 OverallIterations, 44 TraceHistogramMax, 81.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 35138 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13244 ImplicationChecksByTransitivity, 175.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=44, 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.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 180.7s InterpolantComputationTime, 2066 NumberOfCodeBlocks, 2066 NumberOfCodeBlocksAsserted, 339 NumberOfCheckSat, 1979 ConstructedInterpolants, 0 QuantifiedInterpolants, 569581 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4085 ConjunctsInSsa, 2021 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/28380 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/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-01-35-036.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-01-35-036.csv Completed graceful shutdown