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-9f4048f [2018-10-04 12:27:03,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:03,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:03,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:03,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:03,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:03,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:03,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:03,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:03,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:03,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:03,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:03,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:03,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:03,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:03,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:03,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:03,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:03,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:03,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:03,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:03,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:03,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:03,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:03,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:03,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:03,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:03,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:03,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:03,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:03,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:03,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:03,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:03,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:03,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:03,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:03,679 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-10-04 12:27:03,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:03,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:03,694 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:03,694 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:03,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:03,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:03,695 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:03,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:03,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:03,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:03,696 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:03,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:03,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:03,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:03,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:03,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:03,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:03,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:03,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:03,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:03,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:03,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:03,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:03,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:03,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:03,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:03,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:03,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:03,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:03,701 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:03,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:03,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:03,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:03,766 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:03,766 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:03,767 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-10-04 12:27:03,767 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-10-04 12:27:03,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:03,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:03,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:03,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:03,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:03,878 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,898 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:03,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:03,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:03,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:03,920 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,920 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,931 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,932 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,953 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,959 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,962 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 04.10 12:27:03" (1/1) ... [2018-10-04 12:27:03,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:03,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:03,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:03,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:03,975 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 04.10 12:27:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:04,673 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:04,673 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 04.10 12:27:04 BoogieIcfgContainer [2018-10-04 12:27:04,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:04,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:04,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:04,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:04,678 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 04.10 12:27:03" (1/2) ... [2018-10-04 12:27:04,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1c282c 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 04.10 12:27:04, skipping insertion in model container [2018-10-04 12:27:04,679 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 04.10 12:27:04" (2/2) ... [2018-10-04 12:27:04,681 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:27:04,691 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:04,698 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:04,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:04,741 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:04,741 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:04,741 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:04,742 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:04,742 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:04,742 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:04,742 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:04,742 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 12:27:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:04,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:04,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:04,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:04,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-04 12:27:04,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:04,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:05,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:05,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:05,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:05,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:05,065 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 12:27:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:05,132 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-04 12:27:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:05,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:27:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:05,145 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:27:05,146 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:27:05,149 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-10-04 12:27:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:27:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-04 12:27:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:27:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-04 12:27:05,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-04 12:27:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:05,193 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-04 12:27:05,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 12:27:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:05,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:05,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:05,195 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:05,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-04 12:27:05,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:05,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:05,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:05,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:05,320 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-04 12:27:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:05,383 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-04 12:27:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:05,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:27:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:05,389 INFO L225 Difference]: With dead ends: 91 [2018-10-04 12:27:05,392 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:27:05,393 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-10-04 12:27:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:27:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-04 12:27:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:27:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-04 12:27:05,417 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-04 12:27:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:05,417 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-04 12:27:05,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 12:27:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:05,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:05,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:05,419 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:05,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-04 12:27:05,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:05,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:05,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:05,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:05,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:05,610 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-04 12:27:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:05,661 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-04 12:27:05,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:05,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:27:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:05,665 INFO L225 Difference]: With dead ends: 175 [2018-10-04 12:27:05,665 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 12:27:05,666 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-10-04 12:27:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 12:27:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 12:27:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 12:27:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-04 12:27:05,693 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-04 12:27:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:05,693 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-04 12:27:05,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-04 12:27:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:05,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:05,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:05,694 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:05,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-04 12:27:05,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:05,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:05,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:05,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:05,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:05,828 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-04 12:27:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:05,908 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-04 12:27:05,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:05,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:27:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:05,911 INFO L225 Difference]: With dead ends: 343 [2018-10-04 12:27:05,912 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 12:27:05,913 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-10-04 12:27:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 12:27:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-04 12:27:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 12:27:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-04 12:27:05,965 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-04 12:27:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:05,965 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-04 12:27:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-04 12:27:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:05,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:05,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:05,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:05,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-04 12:27:05,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:05,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:05,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:06,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:06,051 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-04 12:27:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:06,136 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-04 12:27:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:06,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:27:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:06,144 INFO L225 Difference]: With dead ends: 569 [2018-10-04 12:27:06,144 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 12:27:06,146 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-10-04 12:27:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 12:27:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-04 12:27:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 12:27:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-04 12:27:06,228 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-04 12:27:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:06,228 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-04 12:27:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-04 12:27:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:27:06,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:06,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:06,231 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:06,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-04 12:27:06,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:06,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:06,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:06,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:06,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:06,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:06,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:06,395 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-04 12:27:06,557 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-04 12:27:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:06,748 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-04 12:27:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:06,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 12:27:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:06,753 INFO L225 Difference]: With dead ends: 610 [2018-10-04 12:27:06,754 INFO L226 Difference]: Without dead ends: 608 [2018-10-04 12:27:06,754 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-10-04 12:27:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-04 12:27:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-04 12:27:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-04 12:27:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-04 12:27:06,824 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-04 12:27:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:06,824 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-04 12:27:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-04 12:27:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:27:06,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:06,829 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-10-04 12:27:06,829 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:06,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-04 12:27:06,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:06,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:06,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:06,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:06,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:06,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:06,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:06,972 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-04 12:27:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:07,158 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-04 12:27:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:07,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:27:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:07,164 INFO L225 Difference]: With dead ends: 1113 [2018-10-04 12:27:07,164 INFO L226 Difference]: Without dead ends: 743 [2018-10-04 12:27:07,166 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-10-04 12:27:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-04 12:27:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-04 12:27:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 12:27:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-04 12:27:07,295 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-04 12:27:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:07,296 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-04 12:27:07,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-04 12:27:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:27:07,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:07,302 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-10-04 12:27:07,302 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:07,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-04 12:27:07,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:07,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:07,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:07,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:07,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:08,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:08,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:27:08,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:27:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:27:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:27:08,004 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-04 12:27:08,369 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:27:10,285 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 12:27:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:10,463 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-04 12:27:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:27:10,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-04 12:27:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:10,471 INFO L225 Difference]: With dead ends: 2109 [2018-10-04 12:27:10,471 INFO L226 Difference]: Without dead ends: 1371 [2018-10-04 12:27:10,473 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-10-04 12:27:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-04 12:27:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-04 12:27:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 12:27:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-04 12:27:10,747 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-04 12:27:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:10,747 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-04 12:27:10,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:27:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-04 12:27:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:27:10,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:10,754 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-10-04 12:27:10,755 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:10,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-04 12:27:10,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:10,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:27:10,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:10,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:10,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:10,929 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-04 12:27:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:11,228 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-04 12:27:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:11,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 12:27:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:11,236 INFO L225 Difference]: With dead ends: 2161 [2018-10-04 12:27:11,237 INFO L226 Difference]: Without dead ends: 975 [2018-10-04 12:27:11,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-04 12:27:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-04 12:27:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-04 12:27:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-04 12:27:11,404 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-04 12:27:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:11,405 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-04 12:27:11,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-04 12:27:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:27:11,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:11,406 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-10-04 12:27:11,407 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-04 12:27:11,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:11,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:27:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 12:27:11,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:11,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:11,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:11,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:11,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:11,484 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-04 12:27:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:11,502 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-04 12:27:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:11,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 12:27:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:11,503 INFO L225 Difference]: With dead ends: 799 [2018-10-04 12:27:11,503 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:11,504 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-10-04 12:27:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:11,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-04 12:27:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:11,506 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:11,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:11,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:11,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:11,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:11,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:12,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:14,323 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 12:27:14,495 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 12:27:14,648 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:15,093 WARN L178 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 12:27:15,381 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 12:27:15,611 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 12:27:15,722 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 12:27:15,928 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 12:27:16,073 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:16,370 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 12:27:16,655 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 12:27:16,768 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 12:27:16,914 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 12:27:16,918 INFO L421 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-10-04 12:27:16,919 INFO L421 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-10-04 12:27:16,919 INFO L421 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-10-04 12:27:16,919 INFO L421 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-10-04 12:27:16,919 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-04 12:27:16,919 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-04 12:27:16,919 INFO L421 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-10-04 12:27:16,919 INFO L421 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-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,920 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,920 INFO L421 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-10-04 12:27:16,921 INFO L421 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-10-04 12:27:16,921 INFO L421 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-10-04 12:27:16,921 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-04 12:27:16,921 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-04 12:27:16,929 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,937 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,937 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,942 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,942 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,945 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,946 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,948 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,948 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,951 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,952 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,953 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,954 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,957 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,957 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,959 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,959 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,961 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,973 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,973 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:16,980 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 04.10 12:27:16 BoogieIcfgContainer [2018-10-04 12:27:16,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:16,981 INFO L168 Benchmark]: Toolchain (without parser) took 13126.51 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -186.5 MB). Peak memory consumption was 623.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:16,986 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:16,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:16,988 INFO L168 Benchmark]: Boogie Preprocessor took 61.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:16,988 INFO L168 Benchmark]: RCFGBuilder took 704.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:16,989 INFO L168 Benchmark]: TraceAbstraction took 12305.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -218.2 MB). Peak memory consumption was 591.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:16,994 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 704.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12305.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -218.2 MB). Peak memory consumption was 591.6 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-10-04 12:27:17,009 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,009 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,010 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,010 WARN L390 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-10-04 12:27:17,014 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,014 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,015 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,015 WARN L390 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-10-04 12:27:17,024 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,024 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,025 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,025 WARN L390 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-10-04 12:27:17,028 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,028 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,032 WARN L390 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-10-04 12:27:17,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,038 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,038 WARN L390 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-10-04 12:27:17,039 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,039 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,043 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,043 WARN L390 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-10-04 12:27:17,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,046 WARN L390 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-10-04 12:27:17,048 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,048 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:17,050 WARN L390 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, 12.1s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s 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.8s 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, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s 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-10-04_12-27-17-057.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-10-04_12-27-17-057.csv Received shutdown request...