java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:29:08,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:29:08,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:29:08,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:29:08,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:29:08,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:29:08,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:29:08,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:29:08,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:29:08,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:29:08,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:29:08,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:29:08,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:29:08,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:29:08,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:29:08,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:29:08,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:29:08,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:29:08,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:29:08,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:29:08,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:29:08,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:29:08,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:29:08,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:29:08,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:29:08,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:29:08,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:29:08,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:29:08,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:29:08,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:29:08,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:29:08,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:29:08,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:29:08,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:29:08,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:29:08,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:29:08,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:29:08,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:29:08,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:29:08,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:29:08,651 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:29:08,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:29:08,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:29:08,652 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:29:08,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:29:08,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:29:08,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:29:08,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:29:08,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:29:08,654 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:29:08,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:29:08,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:29:08,655 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:29:08,655 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:29:08,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:29:08,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:29:08,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:29:08,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:29:08,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:29:08,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:29:08,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:29:08,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:29:08,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:29:08,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:29:08,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:29:08,731 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:29:08,732 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:29:08,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox1.i_3.bpl [2018-09-30 10:29:08,733 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox1.i_3.bpl' [2018-09-30 10:29:08,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:29:08,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:29:08,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:29:08,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:29:08,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:29:08,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:29:08,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:29:08,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:29:08,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:29:08,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/1) ... [2018-09-30 10:29:08,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:29:08,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:29:08,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:29:08,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:29:08,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29: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-09-30 10:29:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:29:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:29:09,166 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:29:09,167 INFO L202 PluginConnector]: Adding new model underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:29:09 BoogieIcfgContainer [2018-09-30 10:29:09,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:29:09,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:29:09,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:29:09,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:29:09,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:29:08" (1/2) ... [2018-09-30 10:29:09,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53291879 and model type underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:29:09, skipping insertion in model container [2018-09-30 10:29:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:29:09" (2/2) ... [2018-09-30 10:29:09,179 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox1.i_3.bpl [2018-09-30 10:29:09,187 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:29:09,195 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:29:09,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:29:09,243 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:29:09,243 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:29:09,243 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:29:09,244 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:29:09,244 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:29:09,244 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:29:09,244 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:29:09,244 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:29:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-30 10:29:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:29:09,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:09,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:29:09,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:09,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-30 10:29:09,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:29:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:09,469 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:29:09,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:29:09,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:29:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:29:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:29:09,488 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-30 10:29:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:09,533 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-30 10:29:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:29:09,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 10:29:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:09,547 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:29:09,547 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:29:09,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:29:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:29:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:29:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:29:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 10:29:09,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-30 10:29:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:09,599 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 10:29:09,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:29:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 10:29:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:29:09,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:09,600 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-30 10:29:09,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:09,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-30 10:29:09,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:09,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:09,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:29:09,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:09,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:29:09,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:29:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:29:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:09,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:29:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:09,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:29:09,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 10:29:09,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:29:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:29:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:29:09,899 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-30 10:29:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:09,937 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 10:29:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:29:09,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 10:29:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:09,939 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:29:09,939 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:29:09,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:29:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:29:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:29:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:29:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:29:09,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-30 10:29:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:09,945 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:29:09,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:29:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:29:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:29:09,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:09,946 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-30 10:29:09,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:09,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-30 10:29:09,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:29:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:10,151 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:29:10,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:29:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:29:10,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:29:10,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:29:10,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:29:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:10,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:29:10,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:29:10,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:29:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:29:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:29:10,249 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-30 10:29:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:10,308 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 10:29:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:29:10,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-30 10:29:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:10,309 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:29:10,309 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:29:10,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:29:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:29:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:29:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:29:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:29:10,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-30 10:29:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:10,314 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:29:10,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:29:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:29:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:29:10,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:10,315 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-30 10:29:10,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:10,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-30 10:29:10,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:10,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:10,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:29:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:10,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:29:10,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:29:10,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:29:10,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:29:10,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:29:10,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:29:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:10,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:29:10,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:29:10,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:29:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:29:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:29:10,782 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-30 10:29:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:10,835 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:29:10,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:29:10,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-30 10:29:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:10,837 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:29:10,837 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:29:10,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:29:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:29:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:29:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:29:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:29:10,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-30 10:29:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:10,843 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:29:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:29:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:29:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:29:10,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:10,844 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-30 10:29:10,844 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:10,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-30 10:29:10,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:10,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:10,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:29:10,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:11,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:29:11,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:29:11,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:29:11,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:29:11,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:29:11,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:29:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:11,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:29:11,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:29:11,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:29:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:29:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:29:11,096 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-30 10:29:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:11,254 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-30 10:29:11,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:29:11,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-30 10:29:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:11,256 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:29:11,256 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:29:11,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:29:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:29:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:29:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:29:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-30 10:29:11,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-30 10:29:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:11,262 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-30 10:29:11,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:29:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-30 10:29:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:29:11,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:11,263 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-30 10:29:11,263 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:11,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-30 10:29:11,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:11,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:29:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:29:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:11,525 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:29:11,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:29:11,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:29:11,621 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:29:11,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:29:11,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:29:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:29:11,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:29:11,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:29:11,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:29:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:29:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:29:11,695 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-30 10:29:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:29:11,787 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:29:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:29:11,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-30 10:29:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:29:11,788 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:29:11,788 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:29:11,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:29:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:29:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:29:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:29:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:29:11,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-30 10:29:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:29:11,794 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:29:11,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:29:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:29:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:29:11,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:29:11,795 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-30 10:29:11,795 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:29:11,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:29:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-30 10:29:11,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:29:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:29:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:11,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:29:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:29:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:29:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:29:11,864 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-30 10:29:11,886 INFO L202 PluginConnector]: Adding new model underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:29:11 BoogieIcfgContainer [2018-09-30 10:29:11,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:29:11,888 INFO L168 Benchmark]: Toolchain (without parser) took 3106.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. [2018-09-30 10:29:11,890 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-09-30 10:29:11,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.45 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-09-30 10:29:11,891 INFO L168 Benchmark]: Boogie Preprocessor took 18.49 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-09-30 10:29:11,892 INFO L168 Benchmark]: RCFGBuilder took 322.64 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-09-30 10:29:11,893 INFO L168 Benchmark]: TraceAbstraction took 2718.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:29:11,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.45 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 18.49 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 322.64 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 2718.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~x~4, main_~y~4; [L12] main_~x~4 := 0; [L13] main_~y~4 := 1; VAL [main_~x~4=0, main_~y~4=1] [L16] assume true; VAL [main_~x~4=0, main_~y~4=1] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=1, main_~y~4=2] [L16] assume true; VAL [main_~x~4=1, main_~y~4=2] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=2, main_~y~4=4] [L16] assume true; VAL [main_~x~4=2, main_~y~4=4] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=3, main_~y~4=8] [L16] assume true; VAL [main_~x~4=3, main_~y~4=8] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=4, main_~y~4=16] [L16] assume true; VAL [main_~x~4=4, main_~y~4=16] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=5, main_~y~4=32] [L16] assume true; VAL [main_~x~4=5, main_~y~4=32] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=6, main_~y~4=64] [L16] assume true; VAL [main_~x~4=6, main_~y~4=64] [L21] assume !(main_~x~4 % 4294967296 < 6); [L22] __VERIFIER_assert_#in~cond := (if main_~y~4 % 4294967296 != 64 then 1 else 0); [L23] havoc __VERIFIER_assert_~cond; [L24] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L25] assume __VERIFIER_assert_~cond == 0; [L26] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.6s OverallTime, 7 OverallIterations, 7 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 0 SDslu, 92 SDs, 0 SdLazy, 133 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=6, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 5 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox1.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-29-11-915.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox1.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-29-11-915.csv Received shutdown request...