java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:50:08,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:50:08,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:50:08,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:50:08,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:50:08,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:50:08,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:50:08,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:50:08,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:50:08,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:50:08,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:50:08,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:50:08,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:50:08,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:50:08,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:50:08,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:50:08,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:50:08,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:50:08,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:50:08,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:50:08,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:50:08,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:50:08,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:50:08,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:50:08,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:50:08,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:50:08,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:50:08,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:50:08,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:50:08,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:50:08,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:50:08,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:50:08,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:50:08,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:50:08,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:50:08,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:50:08,556 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:50:08,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:50:08,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:50:08,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:50:08,586 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:50:08,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:50:08,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:50:08,586 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:50:08,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:50:08,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:50:08,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:50:08,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:50:08,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:50:08,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:50:08,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:50:08,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:50:08,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:50:08,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:50:08,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:50:08,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:50:08,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:50:08,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:50:08,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:50:08,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:50:08,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:50:08,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:50:08,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:50:08,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:50:08,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:50:08,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:50:08,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:50:08,593 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:50:08,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:50:08,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:50:08,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:50:08,672 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:50:08,672 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:50:08,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2018-10-04 09:50:08,674 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2018-10-04 09:50:08,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:50:08,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:50:08,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:50:08,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:50:08,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:50:08,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:50:08,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:50:08,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:50:08,774 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:50:08,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/1) ... [2018-10-04 09:50:08,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:50:08,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:50:08,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:50:08,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:50:08,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (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:50:08,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:50:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:50:08,992 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:50:08,992 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:50:08 BoogieIcfgContainer [2018-10-04 09:50:08,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:50:08,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:50:08,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:50:08,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:50:08,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:08" (1/2) ... [2018-10-04 09:50:08,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c6f7bd and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:50:08, skipping insertion in model container [2018-10-04 09:50:08,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:50:08" (2/2) ... [2018-10-04 09:50:09,000 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2018-10-04 09:50:09,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:50:09,017 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:50:09,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:50:09,067 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:50:09,068 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:50:09,068 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:50:09,068 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:50:09,068 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:50:09,068 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:50:09,069 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:50:09,069 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:50:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 09:50:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:50:09,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:09,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:50:09,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:09,099 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-10-04 09:50:09,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:09,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:09,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:09,228 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:50:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:50:09,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:50:09,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:50:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:50:09,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:09,252 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 09:50:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:09,279 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:50:09,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:50:09,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:50:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:09,292 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:50:09,292 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 09:50:09,295 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:50:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 09:50:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 09:50:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 09:50:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 09:50:09,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 09:50:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:09,331 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 09:50:09,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:50:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 09:50:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:50:09,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:09,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 09:50:09,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:09,332 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-10-04 09:50:09,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:09,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:09,488 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:50:09,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:09,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:09,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:50:09,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:50:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:50:09,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:09,614 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 09:50:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:09,662 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 09:50:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:50:09,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 09:50:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:09,667 INFO L225 Difference]: With dead ends: 8 [2018-10-04 09:50:09,667 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 09:50:09,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 09:50:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 09:50:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 09:50:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:50:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 09:50:09,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 09:50:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:09,670 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 09:50:09,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:50:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 09:50:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:50:09,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:09,671 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 09:50:09,672 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:09,672 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-10-04 09:50:09,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:09,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:09,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:09,778 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:50:09,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:50:09,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:50:09,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:09,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:50:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:50:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:50:09,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:09,862 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 09:50:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:09,884 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:50:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:50:09,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 09:50:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:09,885 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:50:09,886 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:50:09,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:50:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:50:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:50:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:50:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:50:09,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 09:50:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:50:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:50:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:50:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:50:09,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:09,891 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 09:50:09,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:09,891 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-10-04 09:50:09,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:10,004 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:50:10,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:10,005 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:50:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:50:10,047 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 09:50:10,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:10,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:10,115 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:50:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:10,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:10,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:10,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:10,136 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 09:50:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:10,167 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 09:50:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:10,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 09:50:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:10,169 INFO L225 Difference]: With dead ends: 10 [2018-10-04 09:50:10,169 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:50:10,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 09:50:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:50:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:50:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:50:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 09:50:10,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 09:50:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:10,172 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 09:50:10,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 09:50:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:50:10,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:10,173 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 09:50:10,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:10,174 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-10-04 09:50:10,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:10,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:10,480 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:50:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:50:10,501 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:50:10,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:10,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:10,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:50:10,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:50:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:50:10,556 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:10,556 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 09:50:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:10,593 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:50:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:50:10,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 09:50:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:10,600 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:50:10,600 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:50:10,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 5 [2018-10-04 09:50:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:50:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:50:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:50:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:50:10,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 09:50:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:10,604 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:50:10,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:50:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:50:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:50:10,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:10,605 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 09:50:10,606 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:10,606 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:10,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-10-04 09:50:10,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:10,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:10,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:10,715 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:50:10,735 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:50:10,750 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:50:10,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:10,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:10,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:10,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:50:10,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:50:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:50:10,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:10,883 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 09:50:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:10,915 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 09:50:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:50:10,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:50:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:10,917 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:50:10,917 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:50:10,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:50:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:50:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 09:50:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:50:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 09:50:10,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 09:50:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:10,921 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 09:50:10,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:50:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 09:50:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:10,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:10,922 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 09:50:10,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:10,923 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-10-04 09:50:10,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:11,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:11,034 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:50:11,048 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:50:11,078 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:50:11,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:11,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:11,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:11,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:50:11,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:50:11,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:50:11,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:11,139 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 09:50:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:11,168 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:50:11,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:50:11,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 09:50:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:11,169 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:50:11,169 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:50:11,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:50:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:50:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:50:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:50:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:50:11,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 09:50:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:11,173 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:50:11,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:50:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:50:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:50:11,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:11,174 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 09:50:11,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:11,174 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-10-04 09:50:11,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:11,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:11,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:11,670 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:50:11,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:11,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:50:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:50:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:50:11,762 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:11,763 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 09:50:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:11,794 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 09:50:11,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:50:11,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 09:50:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:11,795 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:50:11,795 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:50:11,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 09:50:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:50:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:50:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:50:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:50:11,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 09:50:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:11,800 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:50:11,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:50:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:50:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:50:11,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:11,801 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 09:50:11,802 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:11,802 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-10-04 09:50:11,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:11,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:11,987 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:50:11,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:50:12,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:50:12,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:12,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:12,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:50:12,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:50:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:50:12,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:12,182 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-10-04 09:50:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:12,289 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:50:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:50:12,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-10-04 09:50:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:12,292 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:50:12,292 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:50:12,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:50:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:50:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:50:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:50:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:50:12,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 09:50:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:12,296 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:50:12,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:50:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:50:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:50:12,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:12,297 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 09:50:12,297 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:12,298 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-10-04 09:50:12,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:12,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:50:12,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-04 09:50:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:50:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:50:12,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:12,417 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-10-04 09:50:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:12,445 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:50:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:50:12,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 09:50:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:12,446 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:50:12,446 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:50:12,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 10 [2018-10-04 09:50:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:50:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:50:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:50:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:50:12,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-10-04 09:50:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:12,449 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:50:12,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:50:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:50:12,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:50:12,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:50:12,609 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-04 09:50:12,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 22 30) no Hoare annotation was computed. [2018-10-04 09:50:12,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 22 30) no Hoare annotation was computed. [2018-10-04 09:50:12,612 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-04 09:50:12,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-10-04 09:50:12,613 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 22 30) no Hoare annotation was computed. [2018-10-04 09:50:12,613 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 28) the Hoare annotation is: (or (<= 9 s) (and (<= i 0) (<= 0 s)) (and (<= 4 s) (<= i 4)) (and (<= i 1) (<= 1 s)) (and (<= 8 s) (<= i 8)) (and (<= i 3) (<= 3 s)) (and (<= i 7) (<= 7 s)) (and (<= 5 s) (<= i 5)) (and (<= i 6) (<= 6 s)) (and (<= i 2) (<= 2 s))) [2018-10-04 09:50:12,625 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:50:12 BoogieIcfgContainer [2018-10-04 09:50:12,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:50:12,627 INFO L168 Benchmark]: Toolchain (without parser) took 3899.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 245.9 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:50:12,628 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:50:12,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:50:12,630 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:50:12,630 INFO L168 Benchmark]: RCFGBuilder took 195.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:50:12,631 INFO L168 Benchmark]: TraceAbstraction took 3632.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:50:12,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 195.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3632.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((9 <= s || (i <= 0 && 0 <= s)) || (4 <= s && i <= 4)) || (i <= 1 && 1 <= s)) || (8 <= s && i <= 8)) || (i <= 3 && 3 <= s)) || (i <= 7 && 7 <= s)) || (5 <= s && i <= 5)) || (i <= 6 && 6 <= s)) || (i <= 2 && 2 <= s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 4 SDslu, 43 SDs, 0 SdLazy, 118 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 67 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 2443 SizeOfPredicates, 7 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 45/285 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-50-12-648.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-50-12-648.csv Received shutdown request...