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-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:30:43,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:30:43,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:30:43,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:30:43,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:30:43,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:30:43,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:30:43,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:30:43,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:30:43,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:30:43,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:30:43,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:30:43,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:30:43,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:30:43,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:30:43,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:30:43,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:30:43,097 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:30:43,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:30:43,104 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:30:43,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:30:43,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:30:43,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:30:43,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:30:43,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:30:43,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:30:43,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:30:43,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:30:43,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:30:43,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:30:43,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:30:43,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:30:43,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:30:43,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:30:43,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:30:43,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:30:43,125 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-23 21:30:43,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:30:43,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:30:43,155 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:30:43,155 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:30:43,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:30:43,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:30:43,157 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:30:43,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:30:43,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:30:43,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:30:43,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:30:43,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:30:43,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:30:43,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:30:43,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:30:43,160 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:30:43,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:30:43,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:30:43,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:30:43,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:30:43,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:30:43,162 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:30:43,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:30:43,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:30:43,163 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:30:43,163 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:30:43,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:30:43,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:30:43,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:30:43,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:30:43,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:30:43,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:30:43,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:30:43,262 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:30:43,262 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:30:43,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 21:30:43,263 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-23 21:30:43,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:30:43,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:30:43,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:30:43,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:30:43,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:30:43,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:30:43,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:30:43,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:30:43,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:30:43,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/1) ... [2018-09-23 21:30:43,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:30:43,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:30:43,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:30:43,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:30:43,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30: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-09-23 21:30:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 21:30:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 21:30:44,134 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 21:30:44,134 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:30:44 BoogieIcfgContainer [2018-09-23 21:30:44,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:30:44,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:30:44,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:30:44,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:30:44,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:30:43" (1/2) ... [2018-09-23 21:30:44,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793dd417 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:30:44, skipping insertion in model container [2018-09-23 21:30:44,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:30:44" (2/2) ... [2018-09-23 21:30:44,142 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 21:30:44,153 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:30:44,165 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:30:44,221 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:30:44,222 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:30:44,222 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:30:44,222 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:30:44,223 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:30:44,223 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:30:44,223 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:30:44,225 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:30:44,226 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:30:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-23 21:30:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:44,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:44,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:44,264 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:44,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-23 21:30:44,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:44,532 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-23 21:30:44,535 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:44,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:44,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:44,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:44,557 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-23 21:30:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:44,627 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-23 21:30:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:44,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:30:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:44,641 INFO L225 Difference]: With dead ends: 51 [2018-09-23 21:30:44,642 INFO L226 Difference]: Without dead ends: 33 [2018-09-23 21:30:44,645 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-23 21:30:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-23 21:30:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-23 21:30:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-23 21:30:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-23 21:30:44,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-23 21:30:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:44,700 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-23 21:30:44,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-23 21:30:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:44,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:44,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:44,702 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:44,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-23 21:30:44,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:44,837 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-23 21:30:44,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:44,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:44,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:44,841 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-23 21:30:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:44,884 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-23 21:30:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:44,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:30:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:44,887 INFO L225 Difference]: With dead ends: 91 [2018-09-23 21:30:44,887 INFO L226 Difference]: Without dead ends: 61 [2018-09-23 21:30:44,888 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-23 21:30:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-23 21:30:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-23 21:30:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-23 21:30:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-23 21:30:44,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-23 21:30:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:44,908 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-23 21:30:44,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-23 21:30:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:44,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:44,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:44,909 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:44,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-23 21:30:44,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:45,049 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-23 21:30:45,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:45,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:45,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:45,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:45,052 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-23 21:30:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:45,105 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-23 21:30:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:45,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:30:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:45,110 INFO L225 Difference]: With dead ends: 175 [2018-09-23 21:30:45,110 INFO L226 Difference]: Without dead ends: 117 [2018-09-23 21:30:45,111 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-23 21:30:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-23 21:30:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-23 21:30:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-23 21:30:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-23 21:30:45,142 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-23 21:30:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:45,143 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-23 21:30:45,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-23 21:30:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:45,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:45,144 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:45,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:45,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-23 21:30:45,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:45,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:45,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:45,242 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-23 21:30:45,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:45,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:45,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:45,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:45,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:45,245 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-23 21:30:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:45,344 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-23 21:30:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:45,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:30:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:45,351 INFO L225 Difference]: With dead ends: 343 [2018-09-23 21:30:45,352 INFO L226 Difference]: Without dead ends: 229 [2018-09-23 21:30:45,356 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-23 21:30:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-23 21:30:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-23 21:30:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-23 21:30:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-23 21:30:45,407 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-23 21:30:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:45,408 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-23 21:30:45,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-23 21:30:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:45,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:45,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:45,409 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-23 21:30:45,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:45,496 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-23 21:30:45,496 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:45,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:45,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:45,498 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-23 21:30:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:45,596 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-23 21:30:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:45,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:30:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:45,599 INFO L225 Difference]: With dead ends: 569 [2018-09-23 21:30:45,600 INFO L226 Difference]: Without dead ends: 343 [2018-09-23 21:30:45,602 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-23 21:30:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-23 21:30:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-23 21:30:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-23 21:30:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-23 21:30:45,654 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-23 21:30:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:45,654 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-23 21:30:45,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-23 21:30:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:30:45,655 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:45,656 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:30:45,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:45,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-23 21:30:45,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:45,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:45,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:45,854 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-23 21:30:45,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:45,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:30:45,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:30:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:30:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:30:45,858 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-23 21:30:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:46,196 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-23 21:30:46,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:30:46,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-23 21:30:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:46,201 INFO L225 Difference]: With dead ends: 610 [2018-09-23 21:30:46,201 INFO L226 Difference]: Without dead ends: 608 [2018-09-23 21:30:46,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:30:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-23 21:30:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-23 21:30:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-23 21:30:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-23 21:30:46,279 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-23 21:30:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:46,279 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-23 21:30:46,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:30:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-23 21:30:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 21:30:46,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:46,282 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] [2018-09-23 21:30:46,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:46,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-23 21:30:46,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:46,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:46,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:46,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:30:46,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:46,456 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-23 21:30:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:46,642 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-23 21:30:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:46,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-23 21:30:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:46,648 INFO L225 Difference]: With dead ends: 1113 [2018-09-23 21:30:46,648 INFO L226 Difference]: Without dead ends: 743 [2018-09-23 21:30:46,650 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-23 21:30:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-23 21:30:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-23 21:30:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-23 21:30:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-23 21:30:46,777 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-23 21:30:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:46,778 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-23 21:30:46,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-23 21:30:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 21:30:46,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:46,781 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] [2018-09-23 21:30:46,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:46,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-23 21:30:46,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:47,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:47,171 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-23 21:30:47,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:47,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-23 21:30:47,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:47,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-23 21:30:47,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:30:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:30:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:30:47,548 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-23 21:30:47,778 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-23 21:30:48,140 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 21:30:48,802 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-23 21:30:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:50,119 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-23 21:30:50,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:30:50,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-23 21:30:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:50,127 INFO L225 Difference]: With dead ends: 2109 [2018-09-23 21:30:50,128 INFO L226 Difference]: Without dead ends: 1371 [2018-09-23 21:30:50,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-23 21:30:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-23 21:30:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-23 21:30:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-23 21:30:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-23 21:30:50,371 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-23 21:30:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:50,372 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-23 21:30:50,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:30:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-23 21:30:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-23 21:30:50,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:50,376 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:30:50,376 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:50,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-23 21:30:50,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:50,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-23 21:30:50,537 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:50,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:30:50,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:50,538 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-23 21:30:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:50,863 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-23 21:30:50,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:50,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-23 21:30:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:50,871 INFO L225 Difference]: With dead ends: 2161 [2018-09-23 21:30:50,871 INFO L226 Difference]: Without dead ends: 975 [2018-09-23 21:30:50,873 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-23 21:30:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-23 21:30:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-23 21:30:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-23 21:30:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-23 21:30:51,038 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-23 21:30:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:51,038 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-23 21:30:51,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-23 21:30:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-23 21:30:51,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:51,040 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-23 21:30:51,041 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:51,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-23 21:30:51,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:51,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-23 21:30:51,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:30:51,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:30:51,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:30:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:30:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:30:51,126 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-23 21:30:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:51,149 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-23 21:30:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:30:51,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-23 21:30:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:51,150 INFO L225 Difference]: With dead ends: 799 [2018-09-23 21:30:51,150 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 21:30:51,151 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-23 21:30:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 21:30:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 21:30:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 21:30:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 21:30:51,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-23 21:30:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:51,152 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 21:30:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:30:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 21:30:51,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 21:30:51,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 21:30:51,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:51,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:30:53,443 WARN L178 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-23 21:30:53,799 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 21:30:54,198 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-23 21:30:54,523 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-23 21:30:54,716 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-23 21:30:54,833 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-23 21:30:55,010 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-23 21:30:55,130 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 21:30:55,414 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-23 21:30:55,646 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-23 21:30:55,759 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-23 21:30:55,880 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-23 21:30:55,885 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-23 21:30:55,885 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-23 21:30:55,885 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 21:30:55,885 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-23 21:30:55,886 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-23 21:30:55,886 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-23 21:30:55,886 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-23 21:30:55,886 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-23 21:30:55,886 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-23 21:30:55,886 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-23 21:30:55,887 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 21:30:55,887 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 21:30:55,887 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-23 21:30:55,887 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 21:30:55,887 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-23 21:30:55,888 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-23 21:30:55,888 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-23 21:30:55,888 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-23 21:30:55,888 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-23 21:30:55,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,905 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,905 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,909 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,909 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,915 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,915 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,921 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,922 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,924 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,924 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,928 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,928 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,931 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,931 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,933 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,933 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,935 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,935 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,937 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,938 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,940 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,940 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,943 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,944 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,946 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,946 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,949 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:30:55 BoogieIcfgContainer [2018-09-23 21:30:55,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:30:55,951 INFO L168 Benchmark]: Toolchain (without parser) took 12584.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 60.3 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 559.2 MB). Peak memory consumption was 619.5 MB. Max. memory is 7.1 GB. [2018-09-23 21:30:55,952 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:30:55,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:30:55,953 INFO L168 Benchmark]: Boogie Preprocessor took 36.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:30:55,953 INFO L168 Benchmark]: RCFGBuilder took 685.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 21:30:55,954 INFO L168 Benchmark]: TraceAbstraction took 11813.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 60.3 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 527.5 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. [2018-09-23 21:30:55,959 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 685.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11813.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 60.3 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 527.5 MB). Peak memory consumption was 587.8 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-09-23 21:30:55,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-23 21:30:55,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-23 21:30:55,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-23 21:30:55,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-23 21:30:55,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-23 21:30:55,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-09-23 21:30:55,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-23 21:30:55,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 21:30:55,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 11.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, 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.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-30-56-001.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-30-56-001.csv Received shutdown request...