java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:21:00,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:21:00,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:21:00,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:21:00,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:21:00,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:21:00,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:21:00,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:21:00,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:21:00,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:21:00,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:21:00,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:21:00,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:21:00,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:21:00,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:21:00,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:21:00,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:21:00,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:21:00,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:21:00,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:21:00,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:21:00,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:21:00,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:21:00,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:21:00,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:21:00,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:21:00,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:21:00,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:21:00,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:21:00,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:21:00,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:21:00,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:21:00,689 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:21:00,689 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:21:00,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:21:00,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:21:00,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:21:00,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:21:00,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:21:00,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:21:00,716 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:21:00,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:21:00,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:21:00,718 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:21:00,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:21:00,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:21:00,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:21:00,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:21:00,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:21:00,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:21:00,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:21:00,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:21:00,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:21:00,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:21:00,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:21:00,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:21:00,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:21:00,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:21:00,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:21:00,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:21:00,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:21:00,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:21:00,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:21:00,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:21:00,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:21:00,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:21:00,722 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:21:00,722 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:21:00,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:21:00,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:21:00,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:21:00,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:21:00,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:21:00,791 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-03 09:21:00,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-03 09:21:00,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:21:00,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:21:00,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:21:00,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:21:00,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:21:00,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,887 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 09:21:00,887 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 09:21:00,888 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 09:21:00,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:21:00,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:21:00,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:21:00,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:21:00,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/1) ... [2018-10-03 09:21:00,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:21:00,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:21:00,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:21:00,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:21:00,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (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-03 09:21:00,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-03 09:21:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-03 09:21:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-03 09:21:01,187 INFO L337 CfgBuilder]: Using library mode [2018-10-03 09:21:01,188 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:21:01 BoogieIcfgContainer [2018-10-03 09:21:01,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:21:01,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:21:01,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:21:01,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:21:01,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:21:00" (1/2) ... [2018-10-03 09:21:01,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5411908e and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:21:01, skipping insertion in model container [2018-10-03 09:21:01,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:21:01" (2/2) ... [2018-10-03 09:21:01,196 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-03 09:21:01,208 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:21:01,219 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:21:01,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:21:01,282 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:21:01,282 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:21:01,282 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:21:01,282 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:21:01,282 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:21:01,282 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:21:01,283 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:21:01,283 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:21:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-03 09:21:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-03 09:21:01,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:01,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-03 09:21:01,315 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:01,326 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-03 09:21:01,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:01,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:01,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:01,477 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-03 09:21:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:21:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-03 09:21:01,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:21:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:21:01,497 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:01,500 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-03 09:21:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:01,546 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-03 09:21:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:21:01,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-03 09:21:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:01,564 INFO L225 Difference]: With dead ends: 9 [2018-10-03 09:21:01,564 INFO L226 Difference]: Without dead ends: 4 [2018-10-03 09:21:01,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:21:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-03 09:21:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-03 09:21:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-03 09:21:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-03 09:21:01,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-03 09:21:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:01,603 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-03 09:21:01,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:21:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-03 09:21:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-03 09:21:01,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:01,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-03 09:21:01,604 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:01,604 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-03 09:21:01,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:01,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:01,779 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-03 09:21:01,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:01,782 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-03 09:21:01,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:01,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:01,940 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-03 09:21:01,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:01,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-03 09:21:01,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:21:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:21:01,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:01,980 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-03 09:21:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:02,089 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-03 09:21:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:21:02,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-03 09:21:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:02,091 INFO L225 Difference]: With dead ends: 6 [2018-10-03 09:21:02,091 INFO L226 Difference]: Without dead ends: 5 [2018-10-03 09:21:02,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-03 09:21:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-03 09:21:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-03 09:21:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-03 09:21:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-03 09:21:02,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-03 09:21:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:02,095 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-03 09:21:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:21:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-03 09:21:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 09:21:02,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:02,096 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-03 09:21:02,096 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:02,096 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-03 09:21:02,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:02,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:02,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:02,412 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-03 09:21:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:02,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:21:02,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:21:02,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:02,563 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-03 09:21:02,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:02,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-03 09:21:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:21:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:21:02,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:02,586 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-03 09:21:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:02,627 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-03 09:21:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:21:02,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-03 09:21:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:02,628 INFO L225 Difference]: With dead ends: 7 [2018-10-03 09:21:02,628 INFO L226 Difference]: Without dead ends: 6 [2018-10-03 09:21:02,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 4 [2018-10-03 09:21:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-03 09:21:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-03 09:21:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-03 09:21:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-03 09:21:02,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-03 09:21:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:02,632 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-03 09:21:02,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:21:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-03 09:21:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-03 09:21:02,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:02,633 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-03 09:21:02,634 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:02,634 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-03 09:21:02,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:02,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:02,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:02,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:02,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:02,795 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-03 09:21:02,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:02,796 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-03 09:21:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:21:02,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 09:21:02,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:02,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:03,133 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-03 09:21:03,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:03,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-03 09:21:03,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 09:21:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 09:21:03,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:03,155 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-03 09:21:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:03,214 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-03 09:21:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:21:03,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-03 09:21:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:03,216 INFO L225 Difference]: With dead ends: 8 [2018-10-03 09:21:03,217 INFO L226 Difference]: Without dead ends: 7 [2018-10-03 09:21:03,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 5 [2018-10-03 09:21:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-03 09:21:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-03 09:21:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-03 09:21:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-03 09:21:03,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-03 09:21:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:03,221 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-03 09:21:03,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 09:21:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-03 09:21:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 09:21:03,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:03,222 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-03 09:21:03,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:03,223 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-03 09:21:03,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:03,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:03,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:03,447 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-03 09:21:03,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:03,448 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-03 09:21:03,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:21:03,483 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:21:03,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:03,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:03,629 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-03 09:21:03,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:03,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-03 09:21:03,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:21:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:21:03,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:03,654 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-03 09:21:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:03,768 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-03 09:21:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 09:21:03,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-03 09:21:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:03,769 INFO L225 Difference]: With dead ends: 9 [2018-10-03 09:21:03,769 INFO L226 Difference]: Without dead ends: 8 [2018-10-03 09:21:03,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-03 09:21:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-03 09:21:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-03 09:21:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-03 09:21:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-03 09:21:03,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-03 09:21:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:03,775 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-03 09:21:03,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:21:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-03 09:21:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 09:21:03,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:03,776 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-03 09:21:03,776 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:03,776 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-03 09:21:03,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:03,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:04,034 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-03 09:21:04,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:04,035 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-03 09:21:04,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:21:04,076 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-03 09:21:04,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:04,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:04,599 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-03 09:21:04,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:04,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-03 09:21:04,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:21:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:21:04,621 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:04,621 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-03 09:21:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:04,709 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-03 09:21:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 09:21:04,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-03 09:21:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:04,711 INFO L225 Difference]: With dead ends: 10 [2018-10-03 09:21:04,711 INFO L226 Difference]: Without dead ends: 9 [2018-10-03 09:21:04,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 7 [2018-10-03 09:21:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-03 09:21:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-03 09:21:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 09:21:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-03 09:21:04,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-03 09:21:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:04,716 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-03 09:21:04,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:21:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-03 09:21:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:21:04,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:04,717 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-03 09:21:04,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:04,717 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-03 09:21:04,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:04,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:04,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:05,054 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-03 09:21:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:05,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:21:05,084 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-03 09:21:05,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:05,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:05,269 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-03 09:21:05,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:05,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 09:21:05,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:21:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:21:05,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:05,292 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-03 09:21:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:05,406 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-03 09:21:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:21:05,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-03 09:21:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:05,407 INFO L225 Difference]: With dead ends: 11 [2018-10-03 09:21:05,407 INFO L226 Difference]: Without dead ends: 10 [2018-10-03 09:21:05,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-03 09:21:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-03 09:21:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-03 09:21:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-03 09:21:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-03 09:21:05,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-03 09:21:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:05,413 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-03 09:21:05,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:21:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-03 09:21:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 09:21:05,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:05,414 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-03 09:21:05,414 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:05,414 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-03 09:21:05,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:05,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:05,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:05,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:05,623 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-03 09:21:05,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:05,623 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-03 09:21:05,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:05,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:06,086 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-03 09:21:06,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:06,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-03 09:21:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 09:21:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 09:21:06,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:06,111 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-03 09:21:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:06,253 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-03 09:21:06,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:21:06,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-03 09:21:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:06,255 INFO L225 Difference]: With dead ends: 12 [2018-10-03 09:21:06,255 INFO L226 Difference]: Without dead ends: 11 [2018-10-03 09:21:06,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 9 [2018-10-03 09:21:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-03 09:21:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-03 09:21:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-03 09:21:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-03 09:21:06,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-03 09:21:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:06,261 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-03 09:21:06,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 09:21:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-03 09:21:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 09:21:06,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:06,262 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-03 09:21:06,262 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:06,262 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-03 09:21:06,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:06,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:06,688 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-03 09:21:06,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:06,689 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:06,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:21:06,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:21:06,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:06,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:06,980 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-03 09:21:07,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:07,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-03 09:21:07,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 09:21:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 09:21:07,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:07,005 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-03 09:21:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:07,155 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-03 09:21:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 09:21:07,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-03 09:21:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:07,158 INFO L225 Difference]: With dead ends: 13 [2018-10-03 09:21:07,158 INFO L226 Difference]: Without dead ends: 12 [2018-10-03 09:21:07,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 10 [2018-10-03 09:21:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-03 09:21:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-03 09:21:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-03 09:21:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-03 09:21:07,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-03 09:21:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:07,163 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-03 09:21:07,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 09:21:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-03 09:21:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:21:07,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:07,163 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-03 09:21:07,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:07,164 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-03 09:21:07,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:07,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:07,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:07,506 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-03 09:21:07,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:07,507 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-03 09:21:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:21:07,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-03 09:21:07,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:07,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:07,749 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-03 09:21:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-03 09:21:07,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 09:21:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 09:21:07,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:07,772 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-03 09:21:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:07,962 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-03 09:21:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:21:07,962 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-03 09:21:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:07,963 INFO L225 Difference]: With dead ends: 14 [2018-10-03 09:21:07,963 INFO L226 Difference]: Without dead ends: 13 [2018-10-03 09:21:07,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 11 [2018-10-03 09:21:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-03 09:21:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-03 09:21:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-03 09:21:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-03 09:21:07,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-03 09:21:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:07,967 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-03 09:21:07,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 09:21:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-03 09:21:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 09:21:07,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:07,968 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-03 09:21:07,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:07,969 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-03 09:21:07,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:07,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:08,245 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-03 09:21:08,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:08,245 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-03 09:21:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:21:08,265 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:21:08,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:08,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:09,115 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-03 09:21:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:09,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-03 09:21:09,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-03 09:21:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-03 09:21:09,138 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:09,138 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-03 09:21:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:09,424 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-03 09:21:09,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:21:09,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-03 09:21:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:09,426 INFO L225 Difference]: With dead ends: 15 [2018-10-03 09:21:09,426 INFO L226 Difference]: Without dead ends: 14 [2018-10-03 09:21:09,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 12 [2018-10-03 09:21:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-03 09:21:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-03 09:21:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-03 09:21:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-03 09:21:09,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-03 09:21:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:09,432 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-03 09:21:09,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-03 09:21:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-03 09:21:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 09:21:09,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:09,433 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-03 09:21:09,433 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:09,433 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-03 09:21:09,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:09,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:09,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:09,827 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-03 09:21:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:09,827 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-03 09:21:09,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:21:09,888 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-03 09:21:09,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:09,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:10,263 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-03 09:21:10,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:10,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-03 09:21:10,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-03 09:21:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-03 09:21:10,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:10,286 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-03 09:21:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:10,712 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-03 09:21:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 09:21:10,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-03 09:21:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:10,713 INFO L225 Difference]: With dead ends: 16 [2018-10-03 09:21:10,713 INFO L226 Difference]: Without dead ends: 15 [2018-10-03 09:21:10,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 13 [2018-10-03 09:21:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-03 09:21:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-03 09:21:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-03 09:21:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-03 09:21:10,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-03 09:21:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:10,718 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-03 09:21:10,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-03 09:21:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-03 09:21:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:21:10,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:10,719 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-03 09:21:10,719 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:10,719 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-03 09:21:10,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:10,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:10,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:10,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:11,465 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-03 09:21:11,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:11,466 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-03 09:21:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:21:11,493 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-03 09:21:11,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:11,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:11,915 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-03 09:21:11,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-03 09:21:11,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-03 09:21:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-03 09:21:11,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:11,937 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-03 09:21:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:12,225 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-03 09:21:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 09:21:12,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-03 09:21:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:12,227 INFO L225 Difference]: With dead ends: 17 [2018-10-03 09:21:12,227 INFO L226 Difference]: Without dead ends: 16 [2018-10-03 09:21:12,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 14 [2018-10-03 09:21:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-03 09:21:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-03 09:21:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-03 09:21:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-03 09:21:12,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-03 09:21:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:12,233 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-03 09:21:12,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-03 09:21:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-03 09:21:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:21:12,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:12,235 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-03 09:21:12,236 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:12,236 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-03 09:21:12,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:12,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:12,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:12,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:12,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:12,693 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-03 09:21:12,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:12,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:12,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:13,676 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-03 09:21:13,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:13,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-03 09:21:13,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-03 09:21:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-03 09:21:13,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:13,698 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-03 09:21:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:14,093 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-03 09:21:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 09:21:14,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-03 09:21:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:14,095 INFO L225 Difference]: With dead ends: 18 [2018-10-03 09:21:14,095 INFO L226 Difference]: Without dead ends: 17 [2018-10-03 09:21:14,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime 15 [2018-10-03 09:21:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-03 09:21:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-03 09:21:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 09:21:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-03 09:21:14,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-03 09:21:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:14,102 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-03 09:21:14,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-03 09:21:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-03 09:21:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:21:14,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:14,103 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-03 09:21:14,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:14,103 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-03 09:21:14,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:14,732 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-03 09:21:14,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:14,733 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-03 09:21:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:21:14,755 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:21:14,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:14,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:15,452 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-03 09:21:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:15,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-03 09:21:15,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-03 09:21:15,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-03 09:21:15,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:15,475 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-03 09:21:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:15,980 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-03 09:21:15,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:21:15,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-03 09:21:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:15,981 INFO L225 Difference]: With dead ends: 19 [2018-10-03 09:21:15,981 INFO L226 Difference]: Without dead ends: 18 [2018-10-03 09:21:15,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 16 [2018-10-03 09:21:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-03 09:21:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-03 09:21:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-03 09:21:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-03 09:21:15,987 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-03 09:21:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:15,987 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-03 09:21:15,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-03 09:21:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-03 09:21:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 09:21:15,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:15,988 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-03 09:21:15,988 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:15,988 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-03 09:21:15,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:15,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:15,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:15,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:15,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:16,536 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-03 09:21:16,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:16,536 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-03 09:21:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:21:16,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-03 09:21:16,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:16,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:17,138 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-03 09:21:17,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:17,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-03 09:21:17,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-03 09:21:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-03 09:21:17,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:17,160 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-03 09:21:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:17,637 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-03 09:21:17,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 09:21:17,638 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-03 09:21:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:17,639 INFO L225 Difference]: With dead ends: 20 [2018-10-03 09:21:17,639 INFO L226 Difference]: Without dead ends: 19 [2018-10-03 09:21:17,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 17 [2018-10-03 09:21:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-03 09:21:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-03 09:21:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-03 09:21:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-03 09:21:17,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-03 09:21:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:17,645 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-03 09:21:17,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-03 09:21:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-03 09:21:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:21:17,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:17,646 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-03 09:21:17,646 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:17,646 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-03 09:21:17,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:17,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:17,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:18,239 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-03 09:21:18,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:18,240 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-03 09:21:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:21:18,264 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:21:18,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:18,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:18,936 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-03 09:21:18,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:18,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-03 09:21:18,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-03 09:21:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-03 09:21:18,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:18,959 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-03 09:21:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:19,431 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-03 09:21:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 09:21:19,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-03 09:21:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:19,432 INFO L225 Difference]: With dead ends: 21 [2018-10-03 09:21:19,433 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 09:21:19,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 1.0s impTime 18 [2018-10-03 09:21:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 09:21:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-03 09:21:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-03 09:21:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-03 09:21:19,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-03 09:21:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:19,437 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-03 09:21:19,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-03 09:21:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-03 09:21:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-03 09:21:19,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:19,438 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-03 09:21:19,439 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:19,439 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-03 09:21:19,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:19,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:19,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:20,029 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-03 09:21:20,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:20,030 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-03 09:21:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:21:20,058 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-03 09:21:20,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:20,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:21,315 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-03 09:21:21,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:21,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-03 09:21:21,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-03 09:21:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-03 09:21:21,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:21,337 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-03 09:21:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:22,143 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-03 09:21:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 09:21:22,144 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-03 09:21:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:22,144 INFO L225 Difference]: With dead ends: 22 [2018-10-03 09:21:22,145 INFO L226 Difference]: Without dead ends: 21 [2018-10-03 09:21:22,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 19 [2018-10-03 09:21:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-03 09:21:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-03 09:21:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-03 09:21:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-03 09:21:22,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-03 09:21:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-03 09:21:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-03 09:21:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-03 09:21:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 09:21:22,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:22,152 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-03 09:21:22,152 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:22,152 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-03 09:21:22,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:22,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:22,804 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-03 09:21:22,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:22,804 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-03 09:21:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:21:22,836 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-03 09:21:22,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:22,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:23,885 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-03 09:21:23,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:23,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-03 09:21:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-03 09:21:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-03 09:21:23,908 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:23,908 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-03 09:21:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:24,757 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-03 09:21:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 09:21:24,762 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-03 09:21:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:24,763 INFO L225 Difference]: With dead ends: 23 [2018-10-03 09:21:24,763 INFO L226 Difference]: Without dead ends: 22 [2018-10-03 09:21:24,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.4s impTime 20 [2018-10-03 09:21:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-03 09:21:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-03 09:21:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-03 09:21:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-03 09:21:24,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-03 09:21:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:24,767 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-03 09:21:24,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-03 09:21:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-03 09:21:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-03 09:21:24,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:24,768 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-03 09:21:24,768 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:24,768 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-03 09:21:24,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:24,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:25,668 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-03 09:21:25,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:25,669 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-03 09:21:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:25,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:26,645 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-03 09:21:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:26,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-03 09:21:26,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-03 09:21:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-03 09:21:26,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:26,675 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-03 09:21:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:27,637 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-03 09:21:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 09:21:27,638 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-03 09:21:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:27,638 INFO L225 Difference]: With dead ends: 24 [2018-10-03 09:21:27,638 INFO L226 Difference]: Without dead ends: 23 [2018-10-03 09:21:27,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 21 [2018-10-03 09:21:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-03 09:21:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-03 09:21:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-03 09:21:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-03 09:21:27,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-03 09:21:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:27,644 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-03 09:21:27,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-03 09:21:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-03 09:21:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 09:21:27,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:27,645 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-03 09:21:27,645 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:27,645 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-03 09:21:27,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:27,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:27,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:28,688 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-03 09:21:28,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:28,689 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:21:28,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:21:28,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:28,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:29,693 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-03 09:21:29,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:29,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-03 09:21:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-03 09:21:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-03 09:21:29,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:29,715 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-03 09:21:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:30,594 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-03 09:21:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 09:21:30,594 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-03 09:21:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:30,595 INFO L225 Difference]: With dead ends: 25 [2018-10-03 09:21:30,595 INFO L226 Difference]: Without dead ends: 24 [2018-10-03 09:21:30,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.6s impTime 22 [2018-10-03 09:21:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-03 09:21:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-03 09:21:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-03 09:21:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-03 09:21:30,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-03 09:21:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:30,600 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-03 09:21:30,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-03 09:21:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-03 09:21:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-03 09:21:30,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:30,601 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-03 09:21:30,601 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:30,601 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-03 09:21:30,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:30,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:31,690 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-03 09:21:31,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:31,691 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-03 09:21:31,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:21:31,732 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-03 09:21:31,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:31,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:32,982 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-03 09:21:33,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-03 09:21:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-03 09:21:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-03 09:21:33,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:33,003 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-03 09:21:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:34,126 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-03 09:21:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:21:34,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-03 09:21:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:34,129 INFO L225 Difference]: With dead ends: 26 [2018-10-03 09:21:34,129 INFO L226 Difference]: Without dead ends: 25 [2018-10-03 09:21:34,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.9s impTime 23 [2018-10-03 09:21:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-03 09:21:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-03 09:21:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-03 09:21:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-03 09:21:34,134 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-03 09:21:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-03 09:21:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-03 09:21:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-03 09:21:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-03 09:21:34,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:34,135 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-03 09:21:34,135 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:34,135 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-03 09:21:34,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:34,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:34,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:34,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:34,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:35,939 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-03 09:21:35,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:35,940 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-03 09:21:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:21:35,968 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:21:35,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:35,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:37,247 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-03 09:21:37,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:37,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-03 09:21:37,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-03 09:21:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-03 09:21:37,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:37,269 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-03 09:21:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:38,439 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-03 09:21:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 09:21:38,440 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-03 09:21:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:38,440 INFO L225 Difference]: With dead ends: 27 [2018-10-03 09:21:38,441 INFO L226 Difference]: Without dead ends: 26 [2018-10-03 09:21:38,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.5s impTime 24 [2018-10-03 09:21:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-03 09:21:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-03 09:21:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-03 09:21:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-03 09:21:38,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-03 09:21:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:38,447 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-03 09:21:38,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-03 09:21:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-03 09:21:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 09:21:38,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:38,448 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-03 09:21:38,448 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:38,448 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-03 09:21:38,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:38,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:39,640 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-03 09:21:39,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:39,641 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-03 09:21:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:21:39,689 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-03 09:21:39,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:39,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:41,245 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-03 09:21:41,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-03 09:21:41,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-03 09:21:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-03 09:21:41,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:41,268 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-03 09:21:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:42,299 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-03 09:21:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-03 09:21:42,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-03 09:21:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:42,300 INFO L225 Difference]: With dead ends: 28 [2018-10-03 09:21:42,300 INFO L226 Difference]: Without dead ends: 27 [2018-10-03 09:21:42,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.3s impTime 25 [2018-10-03 09:21:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-03 09:21:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-03 09:21:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-03 09:21:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-03 09:21:42,305 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-03 09:21:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:42,305 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-03 09:21:42,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-03 09:21:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-03 09:21:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:21:42,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:42,306 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-03 09:21:42,306 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:42,306 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-03 09:21:42,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:42,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:42,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:43,547 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-03 09:21:43,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:43,548 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:21:43,594 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-03 09:21:43,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:43,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:45,606 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-03 09:21:45,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:45,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-03 09:21:45,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-03 09:21:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-03 09:21:45,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:45,627 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-03 09:21:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:46,939 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-03 09:21:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 09:21:46,940 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-03 09:21:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:46,941 INFO L225 Difference]: With dead ends: 29 [2018-10-03 09:21:46,941 INFO L226 Difference]: Without dead ends: 28 [2018-10-03 09:21:46,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.8s impTime 26 [2018-10-03 09:21:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-03 09:21:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-03 09:21:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-03 09:21:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-03 09:21:46,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-03 09:21:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:46,954 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-03 09:21:46,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-03 09:21:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-03 09:21:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-03 09:21:46,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:46,955 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-03 09:21:46,955 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:46,955 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-03 09:21:46,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:46,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:46,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:48,411 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-03 09:21:48,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:48,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:21:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:48,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:51,559 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-03 09:21:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-03 09:21:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-03 09:21:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-03 09:21:51,582 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:51,582 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-03 09:21:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:53,072 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-03 09:21:53,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 09:21:53,073 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-03 09:21:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:53,074 INFO L225 Difference]: With dead ends: 30 [2018-10-03 09:21:53,074 INFO L226 Difference]: Without dead ends: 29 [2018-10-03 09:21:53,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time 4.0s impTime 27 [2018-10-03 09:21:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-03 09:21:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-03 09:21:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 09:21:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-03 09:21:53,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-03 09:21:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:53,079 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-03 09:21:53,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-03 09:21:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-03 09:21:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 09:21:53,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:53,080 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-03 09:21:53,080 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:53,081 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-03 09:21:53,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:53,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:53,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:21:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:21:54,676 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-03 09:21:54,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:21:54,677 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-03 09:21:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:21:54,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:21:54,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:21:54,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:21:56,712 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-03 09:21:56,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:21:56,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-03 09:21:56,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-03 09:21:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-03 09:21:56,735 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:21:56,735 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-03 09:21:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:21:58,481 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-03 09:21:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 09:21:58,481 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-03 09:21:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:21:58,482 INFO L225 Difference]: With dead ends: 31 [2018-10-03 09:21:58,482 INFO L226 Difference]: Without dead ends: 30 [2018-10-03 09:21:58,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 3.1s impTime 28 [2018-10-03 09:21:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-03 09:21:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-03 09:21:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-03 09:21:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-03 09:21:58,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-03 09:21:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:21:58,488 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-03 09:21:58,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-03 09:21:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-03 09:21:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-03 09:21:58,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:21:58,489 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-03 09:21:58,489 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:21:58,489 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:21:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-03 09:21:58,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:21:58,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:21:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:58,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:21:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:21:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:00,594 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-03 09:22:00,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:00,595 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-03 09:22:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:22:00,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-03 09:22:00,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:00,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:02,997 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-03 09:22:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:03,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-03 09:22:03,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-03 09:22:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-03 09:22:03,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:03,019 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-03 09:22:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:05,186 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-03 09:22:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 09:22:05,187 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-03 09:22:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:05,187 INFO L225 Difference]: With dead ends: 32 [2018-10-03 09:22:05,187 INFO L226 Difference]: Without dead ends: 31 [2018-10-03 09:22:05,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time 3.8s impTime 29 [2018-10-03 09:22:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-03 09:22:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-03 09:22:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-03 09:22:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-03 09:22:05,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-03 09:22:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:05,193 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-03 09:22:05,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-03 09:22:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-03 09:22:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:22:05,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:05,194 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-03 09:22:05,194 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:05,194 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-03 09:22:05,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:05,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:07,024 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-03 09:22:07,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:07,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:22:07,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:22:07,069 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:22:07,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:07,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:09,257 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-03 09:22:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-03 09:22:09,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-03 09:22:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-03 09:22:09,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:09,280 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-03 09:22:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:11,225 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-03 09:22:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-03 09:22:11,226 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-03 09:22:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:11,226 INFO L225 Difference]: With dead ends: 33 [2018-10-03 09:22:11,226 INFO L226 Difference]: Without dead ends: 32 [2018-10-03 09:22:11,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s Time 3.5s impTime 30 [2018-10-03 09:22:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-03 09:22:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-03 09:22:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-03 09:22:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-03 09:22:11,233 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-03 09:22:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:11,233 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-03 09:22:11,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-03 09:22:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-03 09:22:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-03 09:22:11,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:11,234 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-03 09:22:11,234 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:11,234 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-03 09:22:11,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:11,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:13,343 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-03 09:22:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:13,344 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-03 09:22:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:22:13,406 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-03 09:22:13,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:13,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:16,214 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-03 09:22:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-03 09:22:16,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-03 09:22:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-03 09:22:16,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:16,236 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-03 09:22:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:18,557 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-03 09:22:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 09:22:18,557 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-03 09:22:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:18,558 INFO L225 Difference]: With dead ends: 34 [2018-10-03 09:22:18,558 INFO L226 Difference]: Without dead ends: 33 [2018-10-03 09:22:18,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s Time 4.3s impTime 31 [2018-10-03 09:22:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-03 09:22:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-03 09:22:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-03 09:22:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-03 09:22:18,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-03 09:22:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:18,565 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-03 09:22:18,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-03 09:22:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-03 09:22:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-03 09:22:18,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:18,566 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-03 09:22:18,567 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:18,567 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-03 09:22:18,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:18,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:20,814 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-03 09:22:20,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:20,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:22:20,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:22:20,884 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-03 09:22:20,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:20,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:24,139 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-03 09:22:24,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:24,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-03 09:22:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-03 09:22:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-03 09:22:24,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:24,159 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-03 09:22:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:27,183 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-03 09:22:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 09:22:27,183 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-03 09:22:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:27,184 INFO L225 Difference]: With dead ends: 35 [2018-10-03 09:22:27,184 INFO L226 Difference]: Without dead ends: 34 [2018-10-03 09:22:27,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s Time 4.9s impTime 32 [2018-10-03 09:22:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-03 09:22:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-03 09:22:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-03 09:22:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-03 09:22:27,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-03 09:22:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:27,190 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-03 09:22:27,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-03 09:22:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-03 09:22:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 09:22:27,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:27,191 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-03 09:22:27,191 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:27,191 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-03 09:22:27,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:27,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:27,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:27,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:29,675 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-03 09:22:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:29,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:22:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:22:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:29,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:33,158 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-03 09:22:33,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:33,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-03 09:22:33,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-03 09:22:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-03 09:22:33,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:33,179 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-03 09:22:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:35,843 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-03 09:22:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 09:22:35,844 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-03 09:22:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:35,845 INFO L225 Difference]: With dead ends: 36 [2018-10-03 09:22:35,845 INFO L226 Difference]: Without dead ends: 35 [2018-10-03 09:22:35,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s Time 5.2s impTime 33 [2018-10-03 09:22:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-03 09:22:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-03 09:22:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-03 09:22:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-03 09:22:35,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-03 09:22:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:35,851 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-03 09:22:35,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-03 09:22:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-03 09:22:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 09:22:35,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:35,851 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-03 09:22:35,851 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:35,851 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-03 09:22:35,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:35,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:22:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:38,659 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-03 09:22:38,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:38,659 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-03 09:22:38,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:22:38,713 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:22:38,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:38,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:42,137 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-03 09:22:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:42,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-03 09:22:42,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-03 09:22:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-03 09:22:42,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:42,158 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-03 09:22:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:44,864 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-03 09:22:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 09:22:44,864 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-03 09:22:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:44,865 INFO L225 Difference]: With dead ends: 37 [2018-10-03 09:22:44,865 INFO L226 Difference]: Without dead ends: 36 [2018-10-03 09:22:44,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s Time 5.5s impTime 34 [2018-10-03 09:22:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-03 09:22:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-03 09:22:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-03 09:22:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-03 09:22:44,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-03 09:22:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:44,871 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-03 09:22:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-03 09:22:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-03 09:22:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-03 09:22:44,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:44,872 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-03 09:22:44,872 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:44,872 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-03 09:22:44,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:44,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:44,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:47,864 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-03 09:22:47,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:47,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:22:47,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:22:47,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-03 09:22:47,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:47,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:22:51,850 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-03 09:22:51,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:22:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-03 09:22:51,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-03 09:22:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-03 09:22:51,871 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:22:51,872 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-03 09:22:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:22:55,333 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-03 09:22:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-03 09:22:55,334 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-03 09:22:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:22:55,334 INFO L225 Difference]: With dead ends: 38 [2018-10-03 09:22:55,334 INFO L226 Difference]: Without dead ends: 37 [2018-10-03 09:22:55,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time 6.2s impTime 35 [2018-10-03 09:22:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-03 09:22:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-03 09:22:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 09:22:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-03 09:22:55,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-03 09:22:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:22:55,340 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-03 09:22:55,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-03 09:22:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-03 09:22:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-03 09:22:55,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:22:55,341 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-03 09:22:55,341 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:22:55,341 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:22:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-03 09:22:55,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:22:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:22:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:55,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:22:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:22:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:22:58,538 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-03 09:22:58,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:22:58,538 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-03 09:22:58,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:22:58,598 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:22:58,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:22:58,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:23:02,701 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-03 09:23:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:23:02,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-03 09:23:02,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-03 09:23:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-03 09:23:02,721 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:23:02,721 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-03 09:23:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:23:06,143 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-03 09:23:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 09:23:06,143 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-03 09:23:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:23:06,144 INFO L225 Difference]: With dead ends: 39 [2018-10-03 09:23:06,144 INFO L226 Difference]: Without dead ends: 38 [2018-10-03 09:23:06,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s Time 6.5s impTime 36 [2018-10-03 09:23:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-03 09:23:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-03 09:23:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-03 09:23:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-03 09:23:06,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-03 09:23:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:23:06,149 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-03 09:23:06,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-03 09:23:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-03 09:23:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-03 09:23:06,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:23:06,150 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-03 09:23:06,150 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:23:06,150 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:23:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-03 09:23:06,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:23:06,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:23:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:06,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:23:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:09,593 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-03 09:23:09,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:23:09,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:23:09,601 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:23:09,675 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-03 09:23:09,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:23:09,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:23:13,866 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-03 09:23:13,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:23:13,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-03 09:23:13,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-03 09:23:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-03 09:23:13,887 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:23:13,887 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-03 09:23:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:23:17,425 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-03 09:23:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 09:23:17,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-03 09:23:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:23:17,427 INFO L225 Difference]: With dead ends: 40 [2018-10-03 09:23:17,427 INFO L226 Difference]: Without dead ends: 39 [2018-10-03 09:23:17,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s Time 6.9s impTime 37 [2018-10-03 09:23:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-03 09:23:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-03 09:23:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-03 09:23:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-03 09:23:17,433 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-03 09:23:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:23:17,433 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-03 09:23:17,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-03 09:23:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-03 09:23:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-03 09:23:17,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:23:17,434 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-03 09:23:17,434 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:23:17,434 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:23:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-03 09:23:17,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:23:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:23:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:17,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:23:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:21,241 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-03 09:23:21,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:23:21,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:23:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:23:21,312 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-03 09:23:21,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:23:21,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:23:25,724 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-03 09:23:25,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:23:25,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-03 09:23:25,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-03 09:23:25,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-03 09:23:25,745 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:23:25,745 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-03 09:23:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:23:29,056 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-03 09:23:29,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 09:23:29,056 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-03 09:23:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:23:29,057 INFO L225 Difference]: With dead ends: 41 [2018-10-03 09:23:29,057 INFO L226 Difference]: Without dead ends: 40 [2018-10-03 09:23:29,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s Time 7.3s impTime 38 [2018-10-03 09:23:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-03 09:23:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-03 09:23:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-03 09:23:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-03 09:23:29,063 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-03 09:23:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:23:29,063 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-03 09:23:29,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-03 09:23:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-03 09:23:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-03 09:23:29,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:23:29,064 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-03 09:23:29,064 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:23:29,064 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:23:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-03 09:23:29,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:23:29,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:23:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:29,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:23:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:33,041 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-03 09:23:33,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:23:33,041 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-03 09:23:33,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:23:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:33,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:23:37,819 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-03 09:23:37,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:23:37,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-03 09:23:37,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-03 09:23:37,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-03 09:23:37,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:23:37,841 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-03 09:23:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:23:41,422 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-03 09:23:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-03 09:23:41,423 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-03 09:23:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:23:41,423 INFO L225 Difference]: With dead ends: 42 [2018-10-03 09:23:41,423 INFO L226 Difference]: Without dead ends: 41 [2018-10-03 09:23:41,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s Time 7.8s impTime 39 [2018-10-03 09:23:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-03 09:23:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-03 09:23:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 09:23:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-03 09:23:41,427 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-03 09:23:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:23:41,427 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-03 09:23:41,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-03 09:23:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-03 09:23:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-03 09:23:41,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:23:41,428 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-03 09:23:41,428 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:23:41,428 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:23:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-03 09:23:41,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:23:41,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:23:41,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:23:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:45,644 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-03 09:23:45,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:23:45,644 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-03 09:23:45,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:23:45,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:23:45,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:23:45,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:23:50,829 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-03 09:23:50,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:23:50,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-03 09:23:50,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-03 09:23:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-03 09:23:50,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:23:50,850 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-03 09:23:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:23:54,776 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-03 09:23:54,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 09:23:54,777 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-03 09:23:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:23:54,777 INFO L225 Difference]: With dead ends: 43 [2018-10-03 09:23:54,778 INFO L226 Difference]: Without dead ends: 42 [2018-10-03 09:23:54,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s Time 8.4s impTime 40 [2018-10-03 09:23:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-03 09:23:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-03 09:23:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-03 09:23:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-03 09:23:54,782 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-03 09:23:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:23:54,782 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-03 09:23:54,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-03 09:23:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-03 09:23:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 09:23:54,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:23:54,783 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-03 09:23:54,783 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:23:54,783 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:23:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-03 09:23:54,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:23:54,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:23:54,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:54,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:23:54,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:23:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:23:59,319 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-03 09:23:59,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:23:59,319 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-03 09:23:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:23:59,427 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-03 09:23:59,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:23:59,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:24:05,021 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-03 09:24:05,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:24:05,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-03 09:24:05,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-03 09:24:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-03 09:24:05,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:24:05,042 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-03 09:24:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:24:10,056 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-03 09:24:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-03 09:24:10,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-03 09:24:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:24:10,058 INFO L225 Difference]: With dead ends: 44 [2018-10-03 09:24:10,058 INFO L226 Difference]: Without dead ends: 43 [2018-10-03 09:24:10,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s Time 9.2s impTime 41 [2018-10-03 09:24:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-03 09:24:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-03 09:24:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-03 09:24:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-03 09:24:10,064 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-03 09:24:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:24:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-03 09:24:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-03 09:24:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-03 09:24:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-03 09:24:10,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:24:10,065 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-03 09:24:10,065 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:24:10,065 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:24:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-03 09:24:10,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:24:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:24:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:24:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:24:14,947 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-03 09:24:14,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:24:14,948 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-03 09:24:14,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:24:15,024 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:24:15,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:24:15,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:24:21,256 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-03 09:24:21,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:24:21,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-03 09:24:21,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-03 09:24:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-03 09:24:21,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:24:21,277 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-03 09:24:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:24:26,970 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-03 09:24:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-03 09:24:26,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-03 09:24:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:24:26,971 INFO L225 Difference]: With dead ends: 45 [2018-10-03 09:24:26,971 INFO L226 Difference]: Without dead ends: 44 [2018-10-03 09:24:26,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s Time 10.1s impTime 42 [2018-10-03 09:24:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-03 09:24:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-03 09:24:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-03 09:24:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-03 09:24:26,977 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-03 09:24:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:24:26,977 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-03 09:24:26,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-03 09:24:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-03 09:24:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-03 09:24:26,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:24:26,978 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-03 09:24:26,978 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:24:26,978 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:24:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-03 09:24:26,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:24:26,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:24:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:26,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:24:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:24:32,099 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-03 09:24:32,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:24:32,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:24:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:24:32,226 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-03 09:24:32,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:24:32,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:24:39,384 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-03 09:24:39,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:24:39,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-03 09:24:39,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-03 09:24:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-03 09:24:39,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:24:39,405 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-03 09:24:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:24:46,103 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-03 09:24:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-03 09:24:46,104 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-03 09:24:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:24:46,104 INFO L225 Difference]: With dead ends: 46 [2018-10-03 09:24:46,104 INFO L226 Difference]: Without dead ends: 45 [2018-10-03 09:24:46,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s Time 11.2s impTime 43 [2018-10-03 09:24:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-03 09:24:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-03 09:24:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-03 09:24:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-03 09:24:46,109 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-03 09:24:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:24:46,109 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-03 09:24:46,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-03 09:24:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-03 09:24:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 09:24:46,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:24:46,110 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-03 09:24:46,110 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:24:46,110 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:24:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-03 09:24:46,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:24:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:24:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:46,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:24:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:24:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:24:52,296 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-03 09:24:52,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:24:52,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 09:24:52,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:24:52,436 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-03 09:24:52,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:24:52,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:24:59,091 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-03 09:24:59,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:24:59,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-03 09:24:59,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-03 09:24:59,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-03 09:24:59,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:24:59,113 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-03 09:25:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:25:04,346 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-03 09:25:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 09:25:04,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-03 09:25:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:25:04,348 INFO L225 Difference]: With dead ends: 47 [2018-10-03 09:25:04,348 INFO L226 Difference]: Without dead ends: 46 [2018-10-03 09:25:04,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s Time 11.3s impTime 44 [2018-10-03 09:25:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-03 09:25:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-03 09:25:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-03 09:25:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-03 09:25:04,353 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-03 09:25:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:25:04,353 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-03 09:25:04,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-03 09:25:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-03 09:25:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-03 09:25:04,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:25:04,353 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-03 09:25:04,354 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:25:04,354 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:25:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-03 09:25:04,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:25:04,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:25:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:25:04,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:25:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:25:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:25:10,154 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-03 09:25:10,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:25:10,155 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-03 09:25:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:25:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:25:10,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:25:18,068 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-03 09:25:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:25:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-03 09:25:18,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-03 09:25:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-03 09:25:18,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:25:18,090 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. [2018-10-03 09:25:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:25:25,265 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-03 09:25:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-03 09:25:25,265 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 45 [2018-10-03 09:25:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:25:25,266 INFO L225 Difference]: With dead ends: 48 [2018-10-03 09:25:25,266 INFO L226 Difference]: Without dead ends: 47 [2018-10-03 09:25:25,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s Time 12.4s impTime 45 [2018-10-03 09:25:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-03 09:25:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-03 09:25:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-03 09:25:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-03 09:25:25,272 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-03 09:25:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:25:25,272 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-03 09:25:25,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-03 09:25:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-03 09:25:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-03 09:25:25,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:25:25,272 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-03 09:25:25,273 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:25:25,273 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:25:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-03 09:25:25,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:25:25,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:25:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:25:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:25:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:25:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-03 09:25:29,231 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 09:25:29,235 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 09:25:29,235 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:25:29 BoogieIcfgContainer [2018-10-03 09:25:29,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:25:29,236 INFO L168 Benchmark]: Toolchain (without parser) took 268397.46 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -92.1 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2018-10-03 09:25:29,238 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-03 09:25:29,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:25:29,239 INFO L168 Benchmark]: Boogie Preprocessor took 21.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-03 09:25:29,239 INFO L168 Benchmark]: RCFGBuilder took 276.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:25:29,240 INFO L168 Benchmark]: TraceAbstraction took 268046.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -113.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:25:29,243 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.26 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 47.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.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. * RCFGBuilder took 276.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268046.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -113.3 MB). There was no memory consumed. 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 NestedInterpolantsBuilder was constructing predicates for 45 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 267.9s OverallTime, 45 OverallIterations, 44 TraceHistogramMax, 81.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 34987 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 172.4s 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.2s AutomataMinimizationTime, 44 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 177.6s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-25-29-257.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-25-29-257.csv Completed graceful shutdown