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/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:41:07,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:41:07,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:41:07,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:41:07,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:41:07,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:41:07,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:41:07,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:41:07,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:41:07,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:41:07,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:41:07,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:41:07,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:41:07,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:41:07,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:41:07,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:41:07,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:41:07,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:41:07,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:41:07,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:41:07,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:41:07,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:41:07,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:41:07,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:41:07,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:41:07,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:41:07,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:41:07,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:41:07,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:41:07,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:41:07,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:41:07,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:41:07,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:41:07,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:41:07,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:41:07,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:41:07,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:41:07,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:41:07,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:41:07,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:41:07,689 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:41:07,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:41:07,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:41:07,690 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:41:07,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:41:07,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:41:07,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:41:07,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:41:07,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:41:07,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:41:07,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:41:07,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:41:07,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:41:07,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:41:07,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:41:07,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:41:07,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:41:07,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:41:07,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:41:07,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:41:07,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:41:07,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:41:07,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:41:07,696 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:41:07,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:41:07,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:41:07,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:41:07,697 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:41:07,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:41:07,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:41:07,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:41:07,774 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:41:07,775 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:41:07,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-10-04 09:41:07,776 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-10-04 09:41:07,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:41:07,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:41:07,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:41:07,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:41:07,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:41:07,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:41:07,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:41:07,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:41:07,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:41:07,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... [2018-10-04 09:41:07,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:41:07,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:41:07,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:41:07,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:41:07,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:41:08,213 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:41:08,214 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:41:08 BoogieIcfgContainer [2018-10-04 09:41:08,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:41:08,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:41:08,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:41:08,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:41:08,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:41:07" (1/2) ... [2018-10-04 09:41:08,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155a000e and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:41:08, skipping insertion in model container [2018-10-04 09:41:08,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:41:08" (2/2) ... [2018-10-04 09:41:08,222 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2018-10-04 09:41:08,231 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:41:08,239 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:41:08,289 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:41:08,290 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:41:08,291 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:41:08,291 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:41:08,291 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:41:08,291 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:41:08,291 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:41:08,292 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:41:08,292 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:41:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 09:41:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:41:08,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:08,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 09:41:08,317 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:08,324 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 09:41:08,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:08,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:08,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:41:08,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:08,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:08,523 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 09:41:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:08,574 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 09:41:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:08,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 09:41:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:08,601 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:41:08,601 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:41:08,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:41:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:41:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:41:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:41:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:41:08,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 09:41:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:08,650 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:41:08,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:41:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:41:08,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:08,653 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 09:41:08,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:08,653 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 09:41:08,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:08,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:08,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:08,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:08,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:09,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:41:09,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:41:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:41:09,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:09,124 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 09:41:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:09,234 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:41:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:41:09,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 09:41:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:09,235 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:41:09,236 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:41:09,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 2 [2018-10-04 09:41:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:41:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:41:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:41:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:41:09,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 09:41:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:09,245 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:41:09,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:41:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:41:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:41:09,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:09,246 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 09:41:09,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:09,247 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:09,247 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 09:41:09,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:09,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:09,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:09,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:09,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:09,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:41:09,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:41:09,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:09,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:09,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:09,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:41:09,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:41:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:41:09,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:09,560 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 09:41:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:09,647 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:41:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:41:09,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 09:41:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:09,648 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:41:09,648 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:41:09,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:41:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:41:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:41:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:41:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:41:09,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 09:41:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:41:09,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:41:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:41:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:41:09,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:09,655 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 09:41:09,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:09,656 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 09:41:09,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:09,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:09,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:09,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:09,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:09,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:09,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:41:09,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:41:09,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:09,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:10,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:10,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:41:10,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:41:10,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:41:10,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:10,198 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 09:41:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:10,260 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:41:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:41:10,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 09:41:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:10,262 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:41:10,262 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:41:10,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 4 [2018-10-04 09:41:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:41:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:41:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:41:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:41:10,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 09:41:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:41:10,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:41:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:41:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:41:10,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:10,269 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 09:41:10,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:10,269 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 09:41:10,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:10,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:10,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:10,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:10,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:10,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:10,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:41:10,437 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:41:10,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:10,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:41:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:41:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:41:10,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:10,554 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 09:41:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:10,704 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:41:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:41:10,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 09:41:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:10,706 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:41:10,706 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:41:10,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:41:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:41:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:41:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:41:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:41:10,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 09:41:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:10,711 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:41:10,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:41:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:41:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:41:10,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:10,713 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 09:41:10,713 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:10,713 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 09:41:10,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:10,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:10,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:10,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:10,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:41:10,869 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:41:10,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:10,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:10,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:41:10,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:41:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:41:10,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:10,986 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 09:41:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:11,090 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:41:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:41:11,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 09:41:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:11,092 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:41:11,092 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:41:11,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:41:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:41:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:41:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:41:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:41:11,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 09:41:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:11,097 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:41:11,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:41:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:41:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:41:11,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:11,099 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 09:41:11,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:11,099 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 09:41:11,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:11,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:11,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:11,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:11,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:41:11,540 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:41:11,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:11,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:11,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:11,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:41:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:41:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:41:11,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:11,974 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 09:41:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:12,162 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:41:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:41:12,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:41:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:12,166 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:41:12,166 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:41:12,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 7 [2018-10-04 09:41:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:41:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:41:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:41:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:41:12,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 09:41:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:12,172 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:41:12,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:41:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:41:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:41:12,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:12,173 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 09:41:12,173 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:12,173 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 09:41:12,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:12,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:12,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:12,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:12,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:12,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:41:12,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:41:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:41:12,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:12,470 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 09:41:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:12,561 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:41:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:41:12,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 09:41:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:12,563 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:41:12,563 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:41:12,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:41:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:41:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:41:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:41:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:41:12,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 09:41:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:12,569 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:41:12,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:41:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:41:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:41:12,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:12,570 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 09:41:12,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:12,571 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 09:41:12,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:12,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:12,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:12,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:12,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:12,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:12,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:12,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:41:12,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:41:12,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:12,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:41:12,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:41:12,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:41:12,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:12,939 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 09:41:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:13,093 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 09:41:13,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:41:13,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:41:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:13,097 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:41:13,097 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:41:13,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:41:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:41:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:41:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:41:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 09:41:13,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 09:41:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:13,103 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 09:41:13,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:41:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 09:41:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:41:13,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:13,105 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 09:41:13,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:13,105 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 09:41:13,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:13,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:13,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:13,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:13,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:13,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:41:13,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 09:41:13,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:13,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:13,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:13,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 09:41:13,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:41:13,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:41:13,486 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:13,486 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-04 09:41:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:13,691 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 09:41:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:41:13,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-04 09:41:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:13,692 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:41:13,692 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:41:13,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 09:41:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:41:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:41:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:41:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 09:41:13,698 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-04 09:41:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:13,698 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 09:41:13,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:41:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 09:41:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:41:13,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:13,699 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-04 09:41:13,699 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:13,700 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-04 09:41:13,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:13,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:13,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:14,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:14,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:14,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:41:14,465 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:41:14,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:14,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:14,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 09:41:14,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:41:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:41:14,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:14,930 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-04 09:41:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:15,168 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 09:41:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:41:15,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-04 09:41:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:15,170 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:41:15,170 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:41:15,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime 11 [2018-10-04 09:41:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:41:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:41:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:41:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 09:41:15,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-04 09:41:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:15,179 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 09:41:15,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:41:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 09:41:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:41:15,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:15,180 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-04 09:41:15,180 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:15,180 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-04 09:41:15,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:15,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:15,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:15,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:15,418 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:41:19,089 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 09:41:19,090 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:19,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:19,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:19,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 09:41:19,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:41:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:41:19,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:19,262 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 09:41:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:19,434 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 09:41:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:41:19,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 09:41:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:19,439 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:41:19,439 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:41:19,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 09:41:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:41:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:41:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:41:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 09:41:19,445 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-04 09:41:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:19,445 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 09:41:19,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:41:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 09:41:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:41:19,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:19,446 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-04 09:41:19,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:19,447 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-04 09:41:19,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:19,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:19,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:19,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:41:19,834 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 09:41:19,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:19,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:20,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:20,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 09:41:20,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:41:20,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:41:20,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:20,262 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-04 09:41:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:20,430 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 09:41:20,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:41:20,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-04 09:41:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:20,432 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:41:20,432 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:41:20,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 13 [2018-10-04 09:41:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:41:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:41:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:41:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 09:41:20,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-04 09:41:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:20,439 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 09:41:20,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:41:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 09:41:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:41:20,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:20,440 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-04 09:41:20,440 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:20,440 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-04 09:41:20,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:20,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:20,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:21,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:21,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:21,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:21,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 09:41:21,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:41:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:41:21,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:21,372 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-04 09:41:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:21,574 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 09:41:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:41:21,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-04 09:41:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:21,575 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:41:21,576 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:41:21,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 14 [2018-10-04 09:41:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:41:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:41:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:41:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 09:41:21,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-04 09:41:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:21,583 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 09:41:21,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:41:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 09:41:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:41:21,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:21,585 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-04 09:41:21,585 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:21,585 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-04 09:41:21,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:21,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:21,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:41:21,956 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:41:21,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:21,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:22,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:22,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 09:41:22,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:41:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:41:22,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:22,691 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-04 09:41:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:22,961 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 09:41:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:41:22,962 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-04 09:41:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:22,963 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:41:22,963 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:41:22,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.1s impTime 15 [2018-10-04 09:41:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:41:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 09:41:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:41:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 09:41:22,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-04 09:41:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:22,970 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 09:41:22,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:41:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 09:41:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:41:22,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:22,971 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-04 09:41:22,971 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:22,971 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:22,971 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-04 09:41:22,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:22,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:22,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:22,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:22,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:23,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:23,265 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:23,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:41:23,567 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 09:41:23,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:23,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:23,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:23,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 09:41:23,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 09:41:23,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 09:41:23,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:23,689 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-04 09:41:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:23,892 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 09:41:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:41:23,893 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-04 09:41:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:23,894 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:41:23,894 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:41:23,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 09:41:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:41:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:41:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:41:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 09:41:23,900 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-04 09:41:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:23,901 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 09:41:23,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 09:41:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 09:41:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:41:23,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:23,902 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-04 09:41:23,902 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:23,902 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:23,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-04 09:41:23,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:23,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:23,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:23,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:23,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:24,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:24,602 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:24,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:41:24,626 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:41:24,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:24,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:24,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:24,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 09:41:24,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:41:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:41:24,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:24,817 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-04 09:41:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:25,114 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 09:41:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:41:25,116 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-04 09:41:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:25,117 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:41:25,117 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:41:25,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 17 [2018-10-04 09:41:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:41:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 09:41:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:41:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 09:41:25,123 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-04 09:41:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:25,123 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 09:41:25,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:41:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 09:41:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:41:25,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:25,124 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-04 09:41:25,124 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:25,125 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-04 09:41:25,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:25,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:25,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:25,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:25,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:25,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:25,461 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:25,470 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:41:55,984 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 09:41:55,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:41:56,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:41:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:56,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:41:56,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 09:41:56,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:41:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:41:56,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:56,200 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-04 09:41:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:56,478 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 09:41:56,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:41:56,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-04 09:41:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:56,479 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:41:56,479 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:41:56,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 09:41:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:41:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 09:41:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:41:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 09:41:56,487 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-04 09:41:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:56,487 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 09:41:56,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:41:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 09:41:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 09:41:56,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:56,488 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-04 09:41:56,488 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:56,489 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-04 09:41:56,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:56,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:56,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:56,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:56,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:56,808 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:41:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:41:56,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:41:56,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:41:56,819 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:42:06,812 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 09:42:06,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:42:06,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:42:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:42:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 09:42:06,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:42:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:42:06,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:42:06,964 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-04 09:42:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:42:07,618 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 09:42:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:42:07,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-04 09:42:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:42:07,620 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:42:07,620 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:42:07,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 19 [2018-10-04 09:42:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:42:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:42:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:42:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 09:42:07,627 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-04 09:42:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:42:07,627 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 09:42:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:42:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 09:42:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 09:42:07,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:42:07,629 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-04 09:42:07,629 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:42:07,629 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:42:07,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-04 09:42:07,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:42:07,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:42:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:07,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:42:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:08,084 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:42:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:08,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:42:08,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:42:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:42:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:08,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:42:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:08,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:42:08,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 09:42:08,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 09:42:08,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 09:42:08,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:42:08,393 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-04 09:42:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:42:08,875 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 09:42:08,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:42:08,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-04 09:42:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:42:08,876 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:42:08,877 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:42:08,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 20 [2018-10-04 09:42:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:42:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 09:42:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:42:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 09:42:08,884 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-04 09:42:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:42:08,884 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 09:42:08,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 09:42:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 09:42:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:42:08,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:42:08,885 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-04 09:42:08,886 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:42:08,886 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:42:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-04 09:42:08,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:42:08,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:42:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:42:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:09,306 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:42:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:09,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:42:09,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:42:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:42:09,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:42:09,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:42:09,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:42:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:09,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:42:09,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 09:42:09,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:42:09,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:42:09,557 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:42:09,557 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-04 09:42:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:42:09,893 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 09:42:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:42:09,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-04 09:42:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:42:09,895 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:42:09,895 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:42:09,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 21 [2018-10-04 09:42:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:42:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 09:42:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 09:42:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 09:42:09,901 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-04 09:42:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:42:09,901 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 09:42:09,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:42:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 09:42:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:42:09,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:42:09,902 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-04 09:42:09,903 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:42:09,903 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:42:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-04 09:42:09,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:42:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:42:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:09,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:42:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:10,267 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:42:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:10,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:42:10,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:42:10,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:42:18,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 09:42:18,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:42:18,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:42:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:18,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:42:18,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 09:42:18,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 09:42:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 09:42:18,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:42:18,611 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-04 09:42:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:42:19,014 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 09:42:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:42:19,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-04 09:42:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:42:19,023 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:42:19,023 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:42:19,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 09:42:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:42:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 09:42:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:42:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 09:42:19,028 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-04 09:42:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:42:19,028 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 09:42:19,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 09:42:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 09:42:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:42:19,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:42:19,029 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-04 09:42:19,029 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:42:19,029 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:42:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-04 09:42:19,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:42:19,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:42:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:19,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:42:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:20,046 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:42:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:20,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:42:20,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:42:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:42:20,195 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:42:20,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:42:20,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:42:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:20,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:42:20,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 09:42:20,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 09:42:20,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 09:42:20,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:42:20,339 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-04 09:42:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:42:20,716 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 09:42:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:42:20,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-04 09:42:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:42:20,718 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:42:20,718 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:42:20,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 23 [2018-10-04 09:42:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:42:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 09:42:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 09:42:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 09:42:20,724 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-04 09:42:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:42:20,724 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 09:42:20,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 09:42:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 09:42:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 09:42:20,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:42:20,726 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-04 09:42:20,726 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:42:20,726 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:42:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-04 09:42:20,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:42:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:42:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:20,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:42:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:42:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:42:21,135 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:42:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:42:21,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:42:21,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:42:21,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:43:27,126 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 09:43:27,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:43:27,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:43:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:27,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:43:27,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 09:43:27,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 09:43:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 09:43:27,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:43:27,555 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-04 09:43:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:43:27,971 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 09:43:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:43:27,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-04 09:43:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:43:27,972 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:43:27,973 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:43:27,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 24 [2018-10-04 09:43:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:43:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 09:43:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 09:43:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 09:43:27,979 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-04 09:43:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:43:27,979 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 09:43:27,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 09:43:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 09:43:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 09:43:27,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:43:27,980 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-04 09:43:27,980 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:43:27,980 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:43:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-04 09:43:27,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:43:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:43:27,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:27,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:43:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:43:29,115 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:43:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:29,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:43:29,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:43:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:43:52,895 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 09:43:52,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:43:52,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:43:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:43:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 09:43:53,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 09:43:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 09:43:53,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:43:53,075 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-04 09:43:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:43:53,486 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 09:43:53,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:43:53,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-04 09:43:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:43:53,487 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:43:53,488 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:43:53,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 25 [2018-10-04 09:43:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:43:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 09:43:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 09:43:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 09:43:53,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-04 09:43:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:43:53,494 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 09:43:53,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 09:43:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 09:43:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:43:53,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:43:53,495 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-04 09:43:53,495 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:43:53,495 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:43:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-04 09:43:53,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:43:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:43:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:53,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:43:53,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:43:54,150 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:43:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:43:54,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:43:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:43:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:43:54,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:43:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:54,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:43:54,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 09:43:54,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 09:43:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 09:43:54,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:43:54,541 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-04 09:43:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:43:55,000 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 09:43:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:43:55,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-04 09:43:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:43:55,002 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:43:55,002 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:43:55,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 26 [2018-10-04 09:43:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:43:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:43:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:43:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 09:43:55,009 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-04 09:43:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:43:55,009 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 09:43:55,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 09:43:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 09:43:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 09:43:55,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:43:55,010 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-04 09:43:55,010 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:43:55,010 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:43:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-04 09:43:55,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:43:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:43:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:55,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:43:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:43:55,380 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:43:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:55,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:43:55,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:43:55,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:43:55,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:43:55,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:43:55,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:43:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:43:55,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 09:43:55,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 09:43:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 09:43:55,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:43:55,837 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-04 09:43:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:43:56,405 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 09:43:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:43:56,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-04 09:43:56,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:43:56,406 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:43:56,407 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:43:56,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 27 [2018-10-04 09:43:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:43:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 09:43:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:43:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 09:43:56,411 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-04 09:43:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:43:56,412 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 09:43:56,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 09:43:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 09:43:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:43:56,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:43:56,413 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-04 09:43:56,413 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:43:56,413 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:43:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-04 09:43:56,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:43:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:43:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:56,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:43:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:43:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:43:57,976 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:43:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:43:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:43:58,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:43:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:44:07,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 09:44:07,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:44:07,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:44:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:44:08,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:44:08,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 09:44:08,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 09:44:08,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 09:44:08,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:44:08,065 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-04 09:44:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:44:08,615 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 09:44:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:44:08,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-04 09:44:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:44:08,616 INFO L225 Difference]: With dead ends: 63 [2018-10-04 09:44:08,617 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 09:44:08,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.4s impTime 28 [2018-10-04 09:44:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 09:44:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 09:44:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 09:44:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 09:44:08,622 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-04 09:44:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:44:08,622 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 09:44:08,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 09:44:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 09:44:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 09:44:08,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:44:08,623 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-04 09:44:08,623 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:44:08,624 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:44:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-04 09:44:08,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:44:08,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:44:08,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:44:08,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:44:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:44:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:44:09,007 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:44:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:44:09,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:44:09,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:44:09,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:44:09,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:44:09,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:44:09,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:44:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:44:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:44:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 09:44:09,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 09:44:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 09:44:09,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:44:09,501 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-04 09:44:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:44:10,062 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 09:44:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:44:10,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-04 09:44:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:44:10,063 INFO L225 Difference]: With dead ends: 65 [2018-10-04 09:44:10,063 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:44:10,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 29 [2018-10-04 09:44:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:44:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 09:44:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:44:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 09:44:10,068 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-04 09:44:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:44:10,069 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 09:44:10,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 09:44:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 09:44:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:44:10,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:44:10,069 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-04 09:44:10,070 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:44:10,070 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:44:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-04 09:44:10,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:44:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:44:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:44:10,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:44:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:44:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:44:10,553 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:44:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:44:10,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:44:10,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:44:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown