java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:25:55,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:55,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:55,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:55,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:55,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:55,102 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:55,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:55,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:55,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:55,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:55,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:55,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:55,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:55,115 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:55,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:55,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:55,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:55,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:55,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:55,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:55,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:55,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:55,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:55,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:55,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:55,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:55,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:55,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:55,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:55,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:55,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:55,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:55,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:55,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:55,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:55,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:25:55,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:55,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:55,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:55,178 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:55,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:55,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:55,180 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:55,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:55,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:55,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:55,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:55,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:55,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:55,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:55,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:55,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:55,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:55,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:55,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:55,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:55,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:55,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:55,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:55,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:55,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:55,185 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:55,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:55,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:55,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:55,186 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:55,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:55,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:55,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:55,272 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:55,273 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:55,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-26 21:25:55,274 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl' [2018-09-26 21:25:55,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:55,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:55,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:55,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:55,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:55,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:55,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:55,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:55,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:55,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... [2018-09-26 21:25:55,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:55,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:55,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:55,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:55,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:55,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:56,160 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:56,161 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:56 BoogieIcfgContainer [2018-09-26 21:25:56,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:56,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:56,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:56,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:56,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:55" (1/2) ... [2018-09-26 21:25:56,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6816e1b1 and model type pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:25:56, skipping insertion in model container [2018-09-26 21:25:56,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:56" (2/2) ... [2018-09-26 21:25:56,169 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-26 21:25:56,179 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:56,188 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:56,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:56,247 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:56,247 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:56,247 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:56,247 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:56,247 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:56,247 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:56,248 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:56,248 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-26 21:25:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:25:56,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:56,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:56,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:56,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-26 21:25:56,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:56,518 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:56,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:56,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:56,537 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-26 21:25:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:56,606 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-26 21:25:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:56,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:25:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:56,620 INFO L225 Difference]: With dead ends: 48 [2018-09-26 21:25:56,620 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 21:25:56,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 21:25:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-26 21:25:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:25:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-26 21:25:56,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-26 21:25:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:56,666 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-26 21:25:56,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-26 21:25:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:25:56,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:56,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:56,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:56,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-26 21:25:56,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:56,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:56,793 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:56,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:56,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:56,796 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-26 21:25:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:56,853 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-26 21:25:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:56,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:25:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:56,856 INFO L225 Difference]: With dead ends: 85 [2018-09-26 21:25:56,856 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 21:25:56,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 21:25:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-26 21:25:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 21:25:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-26 21:25:56,875 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-26 21:25:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:56,875 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-26 21:25:56,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-26 21:25:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:25:56,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:56,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:56,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:56,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-26 21:25:56,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:56,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:57,025 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:57,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:57,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:57,027 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-26 21:25:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:57,096 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-26 21:25:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:57,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:25:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:57,100 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:25:57,101 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:25:57,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:25:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-26 21:25:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:25:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-26 21:25:57,163 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-26 21:25:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:57,164 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-26 21:25:57,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-26 21:25:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:25:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:57,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:57,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:57,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-26 21:25:57,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:57,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:57,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:57,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:57,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:57,337 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-26 21:25:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:57,433 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-26 21:25:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:57,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:25:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:57,436 INFO L225 Difference]: With dead ends: 269 [2018-09-26 21:25:57,437 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 21:25:57,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 21:25:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-26 21:25:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:25:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-26 21:25:57,481 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-26 21:25:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:57,481 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-26 21:25:57,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-26 21:25:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:25:57,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:57,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:57,484 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:57,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-26 21:25:57,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:57,613 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:57,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:57,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:57,615 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-26 21:25:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:57,819 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-26 21:25:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:57,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-26 21:25:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:57,823 INFO L225 Difference]: With dead ends: 293 [2018-09-26 21:25:57,823 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 21:25:57,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 21:25:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-26 21:25:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:25:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-26 21:25:57,866 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-26 21:25:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:57,867 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-26 21:25:57,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-26 21:25:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:25:57,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:57,869 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] [2018-09-26 21:25:57,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:57,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-26 21:25:57,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:57,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:57,984 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:57,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:57,986 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-26 21:25:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:58,101 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-26 21:25:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:58,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 21:25:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:58,104 INFO L225 Difference]: With dead ends: 525 [2018-09-26 21:25:58,105 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 21:25:58,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 21:25:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-26 21:25:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 21:25:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-26 21:25:58,172 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-26 21:25:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:58,173 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-26 21:25:58,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-26 21:25:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:25:58,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:58,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:58,176 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:58,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-26 21:25:58,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:58,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:58,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:58,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:58,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:58,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:58,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:58,835 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-09-26 21:25:58,988 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:25:59,544 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:26:00,379 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-26 21:26:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:01,685 INFO L93 Difference]: Finished difference Result 827 states and 1068 transitions. [2018-09-26 21:26:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:26:01,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-09-26 21:26:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:01,692 INFO L225 Difference]: With dead ends: 827 [2018-09-26 21:26:01,693 INFO L226 Difference]: Without dead ends: 481 [2018-09-26 21:26:01,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:26:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-26 21:26:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 307. [2018-09-26 21:26:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 21:26:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2018-09-26 21:26:01,771 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 28 [2018-09-26 21:26:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:01,772 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2018-09-26 21:26:01,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:26:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2018-09-26 21:26:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 21:26:01,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:01,775 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:01,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:01,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2104861015, now seen corresponding path program 2 times [2018-09-26 21:26:01,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:01,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:01,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-09-26 21:26:01,935 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:01,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:01,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:01,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:01,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:01,937 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand 3 states. [2018-09-26 21:26:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:01,979 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2018-09-26 21:26:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:01,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-09-26 21:26:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:01,981 INFO L225 Difference]: With dead ends: 357 [2018-09-26 21:26:01,981 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:26:01,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:26:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:26:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:26:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:26:01,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-26 21:26:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:01,983 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:26:01,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:26:01,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:26:01,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:26:02,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:02,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:03,057 WARN L178 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-26 21:26:03,991 WARN L178 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-09-26 21:26:04,118 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:26:04,315 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-26 21:26:04,476 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-26 21:26:06,016 WARN L178 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-09-26 21:26:06,608 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-26 21:26:06,611 INFO L422 ceAbstractionStarter]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-26 21:26:06,612 INFO L422 ceAbstractionStarter]: At program point L349(lines 344 350) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-26 21:26:06,612 INFO L422 ceAbstractionStarter]: At program point L271(lines 263 272) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-26 21:26:06,612 INFO L422 ceAbstractionStarter]: At program point L329(lines 329 335) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-26 21:26:06,612 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 371) no Hoare annotation was computed. [2018-09-26 21:26:06,612 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 371) no Hoare annotation was computed. [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L276(lines 276 286) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L338(lines 334 345) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L231(lines 231 242) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L359(lines 359 366) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L293(lines 285 294) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-09-26 21:26:06,613 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 371) no Hoare annotation was computed. [2018-09-26 21:26:06,613 INFO L422 ceAbstractionStarter]: At program point L368(lines 224 368) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-09-26 21:26:06,614 INFO L422 ceAbstractionStarter]: At program point L298(lines 298 309) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-09-26 21:26:06,614 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 370) no Hoare annotation was computed. [2018-09-26 21:26:06,614 INFO L422 ceAbstractionStarter]: At program point L315(lines 308 316) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-09-26 21:26:06,614 INFO L422 ceAbstractionStarter]: At program point L249(lines 241 250) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-26 21:26:06,614 INFO L422 ceAbstractionStarter]: At program point L365(lines 365 369) the Hoare annotation is: false [2018-09-26 21:26:06,622 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,623 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,629 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,630 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,635 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,638 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,642 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,642 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,649 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,649 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,653 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,653 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,657 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,657 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,660 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,661 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,665 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:26:06 BoogieIcfgContainer [2018-09-26 21:26:06,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:26:06,666 INFO L168 Benchmark]: Toolchain (without parser) took 11294.04 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 30.5 MB). Peak memory consumption was 479.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:06,667 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-09-26 21:26:06,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.00 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-09-26 21:26:06,669 INFO L168 Benchmark]: Boogie Preprocessor took 54.95 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-09-26 21:26:06,669 INFO L168 Benchmark]: RCFGBuilder took 679.53 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-09-26 21:26:06,670 INFO L168 Benchmark]: TraceAbstraction took 10502.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -1.2 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:06,675 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.19 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 50.00 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 54.95 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 679.53 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 10502.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -1.2 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: 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: 263]: Loop Invariant [2018-09-26 21:26:06,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,687 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,688 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,689 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 285]: Loop Invariant [2018-09-26 21:26:06,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,692 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 254]: Loop Invariant [2018-09-26 21:26:06,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,698 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 276]: Loop Invariant [2018-09-26 21:26:06,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,701 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 298]: Loop Invariant [2018-09-26 21:26:06,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode4 && ~send3 <= 127) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 241]: Loop Invariant [2018-09-26 21:26:06,709 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,709 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-26 21:26:06,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 179 SDslu, 174 SDs, 0 SdLazy, 208 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 72 NumberOfFragments, 1161 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5056 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 439 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 8 QuantifiedInterpolants, 21881 SizeOfPredicates, 1 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 101/117 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.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-26-06-716.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-26-06-716.csv Received shutdown request...