java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:16:01,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:16:01,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:16:01,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:16:01,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:16:01,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:16:01,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:16:01,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:16:01,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:16:01,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:16:01,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:16:01,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:16:01,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:16:01,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:16:01,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:16:01,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:16:01,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:16:01,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:16:01,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:16:01,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:16:01,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:16:01,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:16:01,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:16:01,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:16:01,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:16:01,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:16:01,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:16:01,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:16:01,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:16:01,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:16:01,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:16:01,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:16:01,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:16:01,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:16:01,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:16:01,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:16:01,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:16:01,879 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:16:01,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:16:01,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:16:01,880 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:16:01,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:16:01,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:16:01,884 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:16:01,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:16:01,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:16:01,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:16:01,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:16:01,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:16:01,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:16:01,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:16:01,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:16:01,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:16:01,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:16:01,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:16:01,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:16:01,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:16:01,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:16:01,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:16:01,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:16:01,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:16:01,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:16:01,891 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:16:01,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:16:01,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:16:01,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:16:01,959 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:16:01,960 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:16:01,961 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-10-03 09:16:01,961 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-10-03 09:16:02,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:16:02,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:16:02,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:16:02,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:16:02,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:16:02,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:16:02,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:16:02,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:16:02,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:16:02,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... [2018-10-03 09:16:02,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:16:02,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:16:02,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:16:02,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:16:02,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:16:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:16:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:16:02,425 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:16:02,425 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:16:02 BoogieIcfgContainer [2018-10-03 09:16:02,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:16:02,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:16:02,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:16:02,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:16:02,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:16:02" (1/2) ... [2018-10-03 09:16:02,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3484a2ae and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:16:02, skipping insertion in model container [2018-10-03 09:16:02,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:16:02" (2/2) ... [2018-10-03 09:16:02,433 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03.i_3.bpl [2018-10-03 09:16:02,443 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:16:02,450 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:16:02,503 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:16:02,504 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:16:02,504 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:16:02,504 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:16:02,504 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:16:02,505 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:16:02,505 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:16:02,505 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:16:02,505 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:16:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-03 09:16:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 09:16:02,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:02,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-03 09:16:02,539 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:02,552 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-03 09:16:02,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:02,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:16:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:16:02,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:16:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:16:02,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:02,942 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 5 states. [2018-10-03 09:16:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:03,184 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-10-03 09:16:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:16:03,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-10-03 09:16:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:03,202 INFO L225 Difference]: With dead ends: 20 [2018-10-03 09:16:03,202 INFO L226 Difference]: Without dead ends: 16 [2018-10-03 09:16:03,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-03 09:16:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-03 09:16:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-10-03 09:16:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-03 09:16:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-10-03 09:16:03,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-10-03 09:16:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:03,239 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-10-03 09:16:03,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:16:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-03 09:16:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 09:16:03,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:03,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-03 09:16:03,240 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:03,240 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2018-10-03 09:16:03,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:03,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:03,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:03,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:16:03,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:16:03,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:16:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:16:03,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:03,434 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-10-03 09:16:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:03,600 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-10-03 09:16:03,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:16:03,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-03 09:16:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:03,601 INFO L225 Difference]: With dead ends: 21 [2018-10-03 09:16:03,602 INFO L226 Difference]: Without dead ends: 19 [2018-10-03 09:16:03,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 3 [2018-10-03 09:16:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-03 09:16:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-10-03 09:16:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 09:16:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-10-03 09:16:03,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 6 [2018-10-03 09:16:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:03,616 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-10-03 09:16:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:16:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-10-03 09:16:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 09:16:03,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:03,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:16:03,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:03,619 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1495298495, now seen corresponding path program 1 times [2018-10-03 09:16:03,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:03,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:03,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:03,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:03,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:04,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-03 09:16:04,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:16:04,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:16:04,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:04,036 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 4 states. [2018-10-03 09:16:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:04,149 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-03 09:16:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:16:04,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-03 09:16:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:04,150 INFO L225 Difference]: With dead ends: 28 [2018-10-03 09:16:04,150 INFO L226 Difference]: Without dead ends: 18 [2018-10-03 09:16:04,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 2 [2018-10-03 09:16:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-03 09:16:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-03 09:16:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 09:16:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-10-03 09:16:04,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-10-03 09:16:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:04,159 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-03 09:16:04,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:16:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-10-03 09:16:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:16:04,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:04,160 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-03 09:16:04,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:04,161 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1053631477, now seen corresponding path program 2 times [2018-10-03 09:16:04,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:04,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:04,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:04,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:16:04,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:16:04,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:04,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:04,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:04,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 09:16:04,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:16:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:16:04,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:04,436 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2018-10-03 09:16:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:04,594 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-10-03 09:16:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:16:04,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-03 09:16:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:04,597 INFO L225 Difference]: With dead ends: 28 [2018-10-03 09:16:04,597 INFO L226 Difference]: Without dead ends: 22 [2018-10-03 09:16:04,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-03 09:16:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-03 09:16:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-03 09:16:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-03 09:16:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-03 09:16:04,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2018-10-03 09:16:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:04,610 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-03 09:16:04,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:16:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-03 09:16:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:16:04,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:04,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-03 09:16:04,613 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:04,613 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1036634923, now seen corresponding path program 3 times [2018-10-03 09:16:04,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:04,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:04,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:04,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:04,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:16:05,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-03 09:16:05,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:05,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:05,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:05,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-03 09:16:05,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 09:16:05,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 09:16:05,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:05,550 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-10-03 09:16:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:05,738 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-10-03 09:16:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:16:05,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-03 09:16:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:05,739 INFO L225 Difference]: With dead ends: 32 [2018-10-03 09:16:05,739 INFO L226 Difference]: Without dead ends: 26 [2018-10-03 09:16:05,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-03 09:16:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-03 09:16:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-03 09:16:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-03 09:16:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-03 09:16:05,747 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-10-03 09:16:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:05,748 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-03 09:16:05,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 09:16:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-03 09:16:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 09:16:05,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:05,749 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-03 09:16:05,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:05,750 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1827412127, now seen corresponding path program 4 times [2018-10-03 09:16:05,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:05,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:05,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:05,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:05,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:16:05,984 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:16:05,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:05,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:06,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:06,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:16:06,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:16:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:16:06,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:06,479 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-10-03 09:16:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:06,619 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-10-03 09:16:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 09:16:06,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-03 09:16:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:06,621 INFO L225 Difference]: With dead ends: 36 [2018-10-03 09:16:06,621 INFO L226 Difference]: Without dead ends: 30 [2018-10-03 09:16:06,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.0s impTime 5 [2018-10-03 09:16:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-03 09:16:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-03 09:16:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 09:16:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-03 09:16:06,630 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-10-03 09:16:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:06,631 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-03 09:16:06,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:16:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-03 09:16:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:16:06,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:06,632 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-03 09:16:06,633 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:06,633 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1058473833, now seen corresponding path program 5 times [2018-10-03 09:16:06,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:06,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:06,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:06,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:16:06,909 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-03 09:16:06,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:06,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:07,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:07,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 09:16:07,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:16:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:16:07,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:07,014 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2018-10-03 09:16:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:07,140 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-10-03 09:16:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 09:16:07,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-03 09:16:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:07,142 INFO L225 Difference]: With dead ends: 40 [2018-10-03 09:16:07,142 INFO L226 Difference]: Without dead ends: 34 [2018-10-03 09:16:07,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-03 09:16:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-03 09:16:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-03 09:16:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-03 09:16:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-03 09:16:07,152 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-10-03 09:16:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:07,152 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-03 09:16:07,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:16:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-03 09:16:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:16:07,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:07,153 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-03 09:16:07,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:07,154 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:07,154 INFO L82 PathProgramCache]: Analyzing trace with hash -288981299, now seen corresponding path program 6 times [2018-10-03 09:16:07,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:07,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:07,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:07,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:07,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:07,429 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:16:08,161 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-03 09:16:08,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:08,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:08,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:08,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2018-10-03 09:16:08,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 09:16:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 09:16:08,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:08,863 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 19 states. [2018-10-03 09:16:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:09,654 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-10-03 09:16:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:16:09,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-10-03 09:16:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:09,658 INFO L225 Difference]: With dead ends: 44 [2018-10-03 09:16:09,658 INFO L226 Difference]: Without dead ends: 38 [2018-10-03 09:16:09,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 17 [2018-10-03 09:16:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-03 09:16:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-03 09:16:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 09:16:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-10-03 09:16:09,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2018-10-03 09:16:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:09,672 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-03 09:16:09,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 09:16:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-10-03 09:16:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 09:16:09,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:09,674 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-03 09:16:09,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:09,674 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1231682051, now seen corresponding path program 7 times [2018-10-03 09:16:09,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:09,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:10,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:10,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:10,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:10,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:10,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-03 09:16:10,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 09:16:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 09:16:10,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:10,316 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-10-03 09:16:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:10,642 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-10-03 09:16:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:16:10,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-03 09:16:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:10,644 INFO L225 Difference]: With dead ends: 48 [2018-10-03 09:16:10,646 INFO L226 Difference]: Without dead ends: 42 [2018-10-03 09:16:10,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-03 09:16:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-03 09:16:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-03 09:16:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 09:16:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-03 09:16:10,659 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-10-03 09:16:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:10,659 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-03 09:16:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 09:16:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-03 09:16:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-03 09:16:10,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:10,661 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-03 09:16:10,661 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:10,662 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1657858617, now seen corresponding path program 8 times [2018-10-03 09:16:10,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:16:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:11,071 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:16:11,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:16:11,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:16:11,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:16:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:16:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-03 09:16:11,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:16:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:16:11,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:16:11,466 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2018-10-03 09:16:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:16:11,856 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-10-03 09:16:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 09:16:11,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-03 09:16:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:16:11,858 INFO L225 Difference]: With dead ends: 52 [2018-10-03 09:16:11,858 INFO L226 Difference]: Without dead ends: 46 [2018-10-03 09:16:11,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 9 [2018-10-03 09:16:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-03 09:16:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-03 09:16:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-03 09:16:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-10-03 09:16:11,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2018-10-03 09:16:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:16:11,877 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-10-03 09:16:11,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:16:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-10-03 09:16:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-03 09:16:11,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:16:11,880 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-03 09:16:11,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:16:11,880 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:16:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1841770641, now seen corresponding path program 9 times [2018-10-03 09:16:11,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:16:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:16:11,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:11,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:16:11,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:16:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:16:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:16:12,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:16:12,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:16:12,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:17:13,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-03 09:17:13,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:17:13,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:17:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:17:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:17:13,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-03 09:17:13,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 09:17:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 09:17:13,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:17:13,852 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 12 states. [2018-10-03 09:17:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:17:14,981 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-10-03 09:17:14,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:17:14,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-03 09:17:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:17:14,983 INFO L225 Difference]: With dead ends: 56 [2018-10-03 09:17:14,983 INFO L226 Difference]: Without dead ends: 50 [2018-10-03 09:17:14,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.2s impTime 10 [2018-10-03 09:17:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-03 09:17:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-03 09:17:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-03 09:17:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-10-03 09:17:14,997 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 42 [2018-10-03 09:17:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:17:14,998 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-10-03 09:17:14,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 09:17:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-10-03 09:17:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-03 09:17:14,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:17:14,999 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-03 09:17:14,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:17:14,999 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:17:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1411328421, now seen corresponding path program 10 times [2018-10-03 09:17:15,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:17:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:17:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:17:15,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:17:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:17:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 09:17:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 09:17:15,095 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-03 09:17:15,148 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:17:15 BoogieIcfgContainer [2018-10-03 09:17:15,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:17:15,149 INFO L168 Benchmark]: Toolchain (without parser) took 73137.11 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 44.5 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2018-10-03 09:17:15,151 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:17:15,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:17:15,153 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:17:15,153 INFO L168 Benchmark]: RCFGBuilder took 351.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:17:15,154 INFO L168 Benchmark]: TraceAbstraction took 72721.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 23.3 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:17:15,161 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 351.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72721.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 23.3 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~sn~5=0, main_~x~5=0] [L24] assume true; [L25] assume !false; VAL [main_~sn~5=0, main_~x~5=0] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [main_~sn~5=2, main_~x~5=0] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=1] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=2] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=3] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=4] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=5] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=6] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=7] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=8] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=9] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L24] assume true; [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L34] assume !(main_~x~5 % 4294967296 < 10); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 72.6s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 25 SDslu, 861 SDs, 0 SdLazy, 1075 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 62.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 526 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 86941 SizeOfPredicates, 12 NumberOfNonLiveVariables, 637 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 180/1320 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/sum03.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-17-15-183.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-17-15-183.csv Received shutdown request...