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-c372c2b [2018-10-02 11:48:09,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:09,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:09,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:09,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:09,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:09,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:09,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:09,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:09,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:09,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:09,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:09,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:09,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:09,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:09,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:09,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:09,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:09,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:09,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:09,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:09,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:09,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:09,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:09,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:09,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:09,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:09,949 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:09,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:09,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:09,955 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:09,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:09,956 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:09,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:09,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:09,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:09,959 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-02 11:48:09,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:09,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:09,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:09,991 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:09,992 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:09,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:09,994 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:09,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:09,995 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:09,995 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:09,995 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:09,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:09,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:09,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:09,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:09,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:09,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:09,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:09,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:09,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:09,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:09,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:09,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:09,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:10,000 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:10,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:10,000 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:10,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:10,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:10,001 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:10,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:10,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:10,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:10,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:10,069 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:10,070 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-02 11:48:10,070 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-02 11:48:10,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:10,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:10,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:10,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:10,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:10,181 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,199 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:10,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:10,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:10,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:10,220 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,221 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,226 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,226 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,249 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,255 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,258 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 02.10 11:48:10" (1/1) ... [2018-10-02 11:48:10,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:10,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:10,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:10,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:10,271 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 02.10 11:48:10" (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-02 11:48:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:11,025 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:11,025 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 02.10 11:48:11 BoogieIcfgContainer [2018-10-02 11:48:11,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:11,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:11,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:11,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:11,031 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 02.10 11:48:10" (1/2) ... [2018-10-02 11:48:11,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603dfb6 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 02.10 11:48:11, skipping insertion in model container [2018-10-02 11:48:11,033 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 02.10 11:48:11" (2/2) ... [2018-10-02 11:48:11,035 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 11:48:11,045 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:11,054 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:11,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:11,108 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:11,109 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:11,109 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:11,109 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:11,109 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:11,110 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:11,110 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:11,110 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-02 11:48:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:11,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:11,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:11,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:11,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-02 11:48:11,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:11,463 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-02 11:48:11,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:11,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:11,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:11,490 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-02 11:48:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:11,555 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-02 11:48:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:11,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:48:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:11,573 INFO L225 Difference]: With dead ends: 51 [2018-10-02 11:48:11,573 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:48:11,577 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-02 11:48:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:48:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-02 11:48:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 11:48:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-02 11:48:11,622 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-02 11:48:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:11,624 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-02 11:48:11,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-02 11:48:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:11,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:11,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:11,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:11,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-02 11:48:11,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:11,816 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-02 11:48:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:11,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:11,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:11,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:11,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:11,822 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-02 11:48:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:11,902 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-02 11:48:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:11,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:48:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:11,907 INFO L225 Difference]: With dead ends: 91 [2018-10-02 11:48:11,907 INFO L226 Difference]: Without dead ends: 61 [2018-10-02 11:48:11,910 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-02 11:48:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-02 11:48:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-02 11:48:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 11:48:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-02 11:48:11,946 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-02 11:48:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:11,947 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-02 11:48:11,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-02 11:48:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:11,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:11,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:11,948 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:11,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-02 11:48:11,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:12,086 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-02 11:48:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:12,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:12,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:12,088 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-02 11:48:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:12,161 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-02 11:48:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:12,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:48:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:12,170 INFO L225 Difference]: With dead ends: 175 [2018-10-02 11:48:12,171 INFO L226 Difference]: Without dead ends: 117 [2018-10-02 11:48:12,172 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-02 11:48:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-02 11:48:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-02 11:48:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-02 11:48:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-02 11:48:12,224 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-02 11:48:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:12,225 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-02 11:48:12,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-02 11:48:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:12,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:12,226 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:12,227 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:12,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-02 11:48:12,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:12,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:12,322 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-02 11:48:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:12,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:12,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:12,326 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-02 11:48:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:12,394 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-02 11:48:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:12,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:48:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:12,397 INFO L225 Difference]: With dead ends: 343 [2018-10-02 11:48:12,397 INFO L226 Difference]: Without dead ends: 229 [2018-10-02 11:48:12,399 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-02 11:48:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-02 11:48:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-02 11:48:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-02 11:48:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-02 11:48:12,441 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-02 11:48:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:12,441 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-02 11:48:12,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-02 11:48:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:12,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:12,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:12,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:12,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-02 11:48:12,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:12,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:12,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:12,533 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-02 11:48:12,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:12,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:12,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:12,536 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-02 11:48:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:12,654 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-02 11:48:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:12,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:48:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:12,658 INFO L225 Difference]: With dead ends: 569 [2018-10-02 11:48:12,659 INFO L226 Difference]: Without dead ends: 343 [2018-10-02 11:48:12,660 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-02 11:48:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-02 11:48:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-02 11:48:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-02 11:48:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-02 11:48:12,736 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-02 11:48:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:12,736 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-02 11:48:12,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-02 11:48:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:48:12,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:12,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:12,739 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:12,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-02 11:48:12,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:12,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:12,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:12,905 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-02 11:48:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:48:12,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:12,907 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-02 11:48:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:13,126 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-02 11:48:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:13,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-02 11:48:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:13,130 INFO L225 Difference]: With dead ends: 610 [2018-10-02 11:48:13,131 INFO L226 Difference]: Without dead ends: 608 [2018-10-02 11:48:13,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:48:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-02 11:48:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-02 11:48:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-02 11:48:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-02 11:48:13,207 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-02 11:48:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:13,209 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-02 11:48:13,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-02 11:48:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:48:13,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:13,214 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-02 11:48:13,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:13,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-02 11:48:13,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:13,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:13,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:13,373 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-02 11:48:13,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:13,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:13,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:13,375 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-02 11:48:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:13,552 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-02 11:48:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:13,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:48:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:13,557 INFO L225 Difference]: With dead ends: 1113 [2018-10-02 11:48:13,557 INFO L226 Difference]: Without dead ends: 743 [2018-10-02 11:48:13,559 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-02 11:48:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-02 11:48:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-02 11:48:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-02 11:48:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-02 11:48:13,673 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-02 11:48:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:13,674 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-02 11:48:13,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-02 11:48:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:48:13,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:13,678 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-02 11:48:13,682 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:13,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-02 11:48:13,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:13,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:13,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:14,086 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-02 11:48:14,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:14,087 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-02 11:48:14,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:14,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:14,401 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-02 11:48:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 11:48:14,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:48:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:48:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:48:14,435 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-02 11:48:14,668 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 11:48:15,013 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-02 11:48:15,746 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-02 11:48:16,722 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-02 11:48:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:16,889 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-02 11:48:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:48:16,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-02 11:48:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:16,897 INFO L225 Difference]: With dead ends: 2109 [2018-10-02 11:48:16,897 INFO L226 Difference]: Without dead ends: 1371 [2018-10-02 11:48:16,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:48:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-02 11:48:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-02 11:48:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-02 11:48:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-02 11:48:17,141 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-02 11:48:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:17,141 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-02 11:48:17,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:48:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-02 11:48:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 11:48:17,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:17,145 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-02 11:48:17,148 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:17,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-02 11:48:17,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:17,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:17,292 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-02 11:48:17,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:17,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:17,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:17,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:17,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:17,294 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-02 11:48:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:17,587 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-02 11:48:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:17,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-02 11:48:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:17,593 INFO L225 Difference]: With dead ends: 2161 [2018-10-02 11:48:17,593 INFO L226 Difference]: Without dead ends: 975 [2018-10-02 11:48:17,595 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-02 11:48:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-02 11:48:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-02 11:48:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-02 11:48:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-02 11:48:17,780 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-02 11:48:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:17,781 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-02 11:48:17,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-02 11:48:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 11:48:17,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:17,783 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-02 11:48:17,783 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:17,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-02 11:48:17,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:17,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:17,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:48:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:17,862 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-02 11:48:17,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:17,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:17,864 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-02 11:48:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:17,887 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-02 11:48:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:17,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-02 11:48:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:17,888 INFO L225 Difference]: With dead ends: 799 [2018-10-02 11:48:17,888 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:17,890 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-02 11:48:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:17,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-02 11:48:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:17,891 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:17,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:17,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:17,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:17,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:17,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:18,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:20,756 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-02 11:48:20,890 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-02 11:48:21,452 WARN L178 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:22,137 WARN L178 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-02 11:48:22,319 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-02 11:48:22,510 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-02 11:48:22,655 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-02 11:48:22,893 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-02 11:48:23,011 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:23,278 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-02 11:48:23,556 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-02 11:48:23,671 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-02 11:48:23,791 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-02 11:48:23,794 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-02 11:48:23,795 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-02 11:48:23,795 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-02 11:48:23,795 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-02 11:48:23,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-02 11:48:23,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-02 11:48:23,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-02 11:48:23,796 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-02 11:48:23,796 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-02 11:48:23,796 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-02 11:48:23,797 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-02 11:48:23,797 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-02 11:48:23,797 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-02 11:48:23,797 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-02 11:48:23,797 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-02 11:48:23,798 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-02 11:48:23,798 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-02 11:48:23,798 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-02 11:48:23,798 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-02 11:48:23,807 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,808 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,814 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,814 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,817 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,817 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,819 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,819 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,822 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,822 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,829 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,829 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,832 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,832 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,836 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,849 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 02.10 11:48:23 BoogieIcfgContainer [2018-10-02 11:48:23,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:23,850 INFO L168 Benchmark]: Toolchain (without parser) took 13693.32 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -103.0 MB). Peak memory consumption was 596.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:23,851 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:23,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.04 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-02 11:48:23,853 INFO L168 Benchmark]: Boogie Preprocessor took 60.87 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-02 11:48:23,853 INFO L168 Benchmark]: RCFGBuilder took 756.93 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-02 11:48:23,854 INFO L168 Benchmark]: TraceAbstraction took 12822.64 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.7 MB). Peak memory consumption was 564.9 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:23,858 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.04 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 60.87 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 756.93 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 12822.64 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.7 MB). Peak memory consumption was 564.9 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-02 11:48:23,867 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,868 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,869 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,869 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-02 11:48:23,870 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,870 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,871 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,871 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-02 11:48:23,872 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,873 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,874 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,874 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-02 11:48:23,876 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,876 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,877 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,877 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-02 11:48:23,878 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,879 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,879 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,880 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-02 11:48:23,881 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,881 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,882 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,882 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-02 11:48:23,883 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,883 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,884 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,884 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-02 11:48:23,885 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,886 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,887 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:23,887 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.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s 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, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s 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-02_11-48-23-893.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-02_11-48-23-893.csv Received shutdown request...