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/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:43,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:43,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:43,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:43,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:43,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:43,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:43,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:43,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:43,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:43,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:43,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:43,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:43,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:43,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:43,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:43,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:43,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:43,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:43,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:43,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:43,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:43,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:43,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:43,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:43,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:43,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:43,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:43,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:43,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:43,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:43,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:43,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:43,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:43,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:43,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:43,534 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-01 00:55:43,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:43,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:43,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:43,562 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:43,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:43,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:43,563 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:43,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:43,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:43,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:43,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:43,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:43,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:43,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:43,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:43,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:43,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:43,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:43,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:43,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:43,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:43,569 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:43,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:43,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:43,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:43,570 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:43,570 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:43,570 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:43,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:43,571 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:43,571 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:43,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:43,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:43,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:43,648 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:43,649 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:43,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-01 00:55:43,650 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-10-01 00:55:43,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:43,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:43,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:43,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:43,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:43,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:43,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:43,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:43,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:43,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/1) ... [2018-10-01 00:55:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:43,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:43,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:43,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:43,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (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-01 00:55:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:43,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:44,572 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:44,572 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:44 BoogieIcfgContainer [2018-10-01 00:55:44,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:44,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:44,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:44,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:44,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:43" (1/2) ... [2018-10-01 00:55:44,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2601c3 and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:44, skipping insertion in model container [2018-10-01 00:55:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:44" (2/2) ... [2018-10-01 00:55:44,580 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-01 00:55:44,590 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:44,599 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:44,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:44,649 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:44,650 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:44,650 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:44,650 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:44,650 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:44,651 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:44,651 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:44,651 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-01 00:55:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:44,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:44,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:44,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:44,683 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-01 00:55:44,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:44,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:44,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:45,007 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-01 00:55:45,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:45,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:45,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:45,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:45,034 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-01 00:55:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:45,177 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-01 00:55:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:45,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:45,196 INFO L225 Difference]: With dead ends: 54 [2018-10-01 00:55:45,196 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:55:45,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:55:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-01 00:55:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:55:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-01 00:55:45,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-01 00:55:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:45,244 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-01 00:55:45,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-01 00:55:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:45,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:45,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:45,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:45,245 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-01 00:55:45,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:45,356 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-01 00:55:45,356 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:45,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:45,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:45,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:45,359 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-01 00:55:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:45,417 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-01 00:55:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:45,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:45,419 INFO L225 Difference]: With dead ends: 97 [2018-10-01 00:55:45,419 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:55:45,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:55:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-01 00:55:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:55:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-01 00:55:45,440 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-01 00:55:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:45,441 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-01 00:55:45,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-01 00:55:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:45,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:45,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:45,443 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:45,443 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-01 00:55:45,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:45,545 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-01 00:55:45,545 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:45,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:45,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:45,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:45,547 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-01 00:55:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:45,639 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-01 00:55:45,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:45,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:45,651 INFO L225 Difference]: With dead ends: 187 [2018-10-01 00:55:45,651 INFO L226 Difference]: Without dead ends: 125 [2018-10-01 00:55:45,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-01 00:55:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-01 00:55:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-01 00:55:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-01 00:55:45,693 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-01 00:55:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:45,693 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-01 00:55:45,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-01 00:55:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:45,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:45,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:45,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:45,695 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-01 00:55:45,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:45,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:45,835 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-01 00:55:45,836 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:45,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:45,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:45,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:45,840 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-01 00:55:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:46,035 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-01 00:55:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:46,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:46,046 INFO L225 Difference]: With dead ends: 367 [2018-10-01 00:55:46,046 INFO L226 Difference]: Without dead ends: 245 [2018-10-01 00:55:46,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-01 00:55:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-01 00:55:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-01 00:55:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-01 00:55:46,112 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-01 00:55:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:46,113 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-01 00:55:46,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-01 00:55:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:46,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:46,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:46,114 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:46,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-01 00:55:46,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:46,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:46,255 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-01 00:55:46,256 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:46,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:46,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:46,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:46,257 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-01 00:55:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:46,858 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-01 00:55:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:46,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-01 00:55:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:46,862 INFO L225 Difference]: With dead ends: 517 [2018-10-01 00:55:46,862 INFO L226 Difference]: Without dead ends: 515 [2018-10-01 00:55:46,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:55:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-01 00:55:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-01 00:55:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-01 00:55:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-01 00:55:46,936 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-01 00:55:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:46,937 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-01 00:55:46,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-01 00:55:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:46,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:46,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:46,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:46,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-01 00:55:46,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:46,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:46,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:46,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:47,178 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-01 00:55:47,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:47,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:47,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:47,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:47,180 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-01 00:55:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:47,890 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-10-01 00:55:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:55:47,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-01 00:55:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:47,894 INFO L225 Difference]: With dead ends: 799 [2018-10-01 00:55:47,895 INFO L226 Difference]: Without dead ends: 525 [2018-10-01 00:55:47,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:55:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-01 00:55:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-10-01 00:55:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:55:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-10-01 00:55:47,980 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-10-01 00:55:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:47,980 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-10-01 00:55:47,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-10-01 00:55:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:55:47,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:47,983 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:47,984 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:47,984 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-10-01 00:55:47,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:47,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:47,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:48,140 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:48,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:48,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:48,141 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:48,141 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-10-01 00:55:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:48,554 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-10-01 00:55:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:48,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-01 00:55:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:48,560 INFO L225 Difference]: With dead ends: 1207 [2018-10-01 00:55:48,560 INFO L226 Difference]: Without dead ends: 805 [2018-10-01 00:55:48,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-10-01 00:55:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-10-01 00:55:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-10-01 00:55:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-10-01 00:55:48,726 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-10-01 00:55:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:48,727 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-10-01 00:55:48,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-10-01 00:55:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:55:48,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:48,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:48,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:48,731 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-10-01 00:55:48,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:48,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:48,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:55:48,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:48,895 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-01 00:55:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:49,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:55:49,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:49,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-01 00:55:49,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:55:49,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:55:49,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:49,699 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 5 states. [2018-10-01 00:55:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:50,359 INFO L93 Difference]: Finished difference Result 1525 states and 1892 transitions. [2018-10-01 00:55:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:50,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-01 00:55:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:50,361 INFO L225 Difference]: With dead ends: 1525 [2018-10-01 00:55:50,361 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:55:50,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:55:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:55:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:55:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:55:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:55:50,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-10-01 00:55:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:50,365 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:55:50,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:55:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:55:50,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:55:50,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:55:50,533 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 11 [2018-10-01 00:55:50,822 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 11 [2018-10-01 00:55:51,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,273 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2018-10-01 00:55:51,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:51,899 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:52,071 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:52,243 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:52,437 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:52,613 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:52,777 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:53,033 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:53,947 WARN L178 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 7 [2018-10-01 00:55:54,118 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:54,716 WARN L178 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2018-10-01 00:55:54,898 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:55,005 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-01 00:55:55,055 INFO L422 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,055 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,055 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,056 INFO L422 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,056 INFO L422 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,056 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-10-01 00:55:55,056 INFO L422 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (<= ~r1 4) [2018-10-01 00:55:55,056 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-10-01 00:55:55,056 INFO L422 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (<= ~r1 4) [2018-10-01 00:55:55,057 INFO L422 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 4) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-10-01 00:55:55,057 INFO L422 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,057 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-10-01 00:55:55,057 INFO L422 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (<= ~r1 4) [2018-10-01 00:55:55,057 INFO L422 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,057 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-10-01 00:55:55,058 INFO L422 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,058 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-10-01 00:55:55,058 INFO L422 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,058 INFO L422 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 4)) [2018-10-01 00:55:55,058 INFO L422 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (<= ~r1 4) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-10-01 00:55:55,072 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:55 BoogieIcfgContainer [2018-10-01 00:55:55,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:55,073 INFO L168 Benchmark]: Toolchain (without parser) took 11316.16 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 227.8 MB). Peak memory consumption was 491.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:55,075 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:55,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.27 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-01 00:55:55,076 INFO L168 Benchmark]: Boogie Preprocessor took 63.52 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-01 00:55:55,077 INFO L168 Benchmark]: RCFGBuilder took 688.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:55,078 INFO L168 Benchmark]: TraceAbstraction took 10498.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Peak memory consumption was 459.9 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:55,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.27 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 63.52 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 688.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10498.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Peak memory consumption was 459.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ~r1 <= 4 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ~r1 <= 4 && 1 <= check_~tmp~106 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ~r1 <= 4 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((assert_~arg <= 1 && 1 <= assert_~arg) && ~r1 <= 4) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 4 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ~r1 <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 10.4s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 167 SDslu, 223 SDs, 0 SdLazy, 44 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=7, 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 372 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 738 NumberOfFragments, 140 HoareAnnotationTreeSize, 16 FomulaSimplifications, 49770 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 844 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 189 ConstructedInterpolants, 10 QuantifiedInterpolants, 32993 SizeOfPredicates, 1 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 25/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-55-102.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-55-102.csv Received shutdown request...