java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:14:35,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:14:35,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:14:35,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:14:35,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:14:35,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:14:35,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:14:35,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:14:35,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:14:35,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:14:35,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:14:35,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:14:35,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:14:35,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:14:35,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:14:35,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:14:35,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:14:35,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:14:35,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:14:35,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:14:35,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:14:35,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:14:35,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:14:35,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:14:35,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:14:35,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:14:35,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:14:35,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:14:35,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:14:35,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:14:35,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:14:35,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:14:35,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:14:35,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:14:35,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:14:35,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:14:35,327 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:14:35,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:14:35,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:14:35,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:14:35,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:14:35,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:14:35,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:14:35,358 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:14:35,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:14:35,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:14:35,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:14:35,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:14:35,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:14:35,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:14:35,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:14:35,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:14:35,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:14:35,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:14:35,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:14:35,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:14:35,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:14:35,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:14:35,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:14:35,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:14:35,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:14:35,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:14:35,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:14:35,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:14:35,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:14:35,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:14:35,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:14:35,365 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:14:35,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:14:35,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:14:35,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:14:35,438 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:14:35,439 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:14:35,439 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.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-02 12:14:35,440 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl' [2018-10-02 12:14:35,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:14:35,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:14:35,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:14:35,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:14:35,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:14:35,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:14:35,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:14:35,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:14:35,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:14:35,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/1) ... [2018-10-02 12:14:35,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:14:35,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:14:35,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:14:35,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:14:35,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (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 12:14:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:14:35,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:14:36,249 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:14:36,249 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:14:36 BoogieIcfgContainer [2018-10-02 12:14:36,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:14:36,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:14:36,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:14:36,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:14:36,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:14:35" (1/2) ... [2018-10-02 12:14:36,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bf5ab3 and model type pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:14:36, skipping insertion in model container [2018-10-02 12:14:36,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:14:36" (2/2) ... [2018-10-02 12:14:36,257 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-02 12:14:36,266 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:14:36,275 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:14:36,324 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:14:36,325 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:14:36,325 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:14:36,325 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:14:36,326 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:14:36,326 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:14:36,326 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:14:36,326 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:14:36,326 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:14:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-02 12:14:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:14:36,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:36,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:36,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:36,356 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-02 12:14:36,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:36,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:36,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:36,616 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 12:14:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:14:36,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:36,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:36,641 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-02 12:14:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:36,733 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-02 12:14:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:36,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 12:14:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:36,748 INFO L225 Difference]: With dead ends: 45 [2018-10-02 12:14:36,748 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 12:14:36,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 12:14:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-02 12:14:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 12:14:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-02 12:14:36,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-02 12:14:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:36,788 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-02 12:14:36,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-02 12:14:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:14:36,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:36,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:36,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:36,790 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-02 12:14:36,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:36,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:36,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:36,915 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 12:14:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:36,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:14:36,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:36,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:36,919 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-02 12:14:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:36,997 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-10-02 12:14:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:36,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 12:14:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:36,999 INFO L225 Difference]: With dead ends: 79 [2018-10-02 12:14:37,000 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 12:14:37,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 12:14:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-02 12:14:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 12:14:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-10-02 12:14:37,017 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-10-02 12:14:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:37,017 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-10-02 12:14:37,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-10-02 12:14:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:14:37,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:37,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:37,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:37,019 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-10-02 12:14:37,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:37,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:37,169 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 12:14:37,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:37,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:14:37,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:14:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:14:37,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:37,171 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-10-02 12:14:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:37,671 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-02 12:14:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:14:37,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-02 12:14:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:37,676 INFO L225 Difference]: With dead ends: 109 [2018-10-02 12:14:37,676 INFO L226 Difference]: Without dead ends: 107 [2018-10-02 12:14:37,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-02 12:14:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-02 12:14:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 12:14:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-10-02 12:14:37,716 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-10-02 12:14:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:37,717 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-10-02 12:14:37,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:14:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-10-02 12:14:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:14:37,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:37,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:37,719 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:37,719 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-10-02 12:14:37,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:37,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:37,850 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 12:14:37,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:37,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:14:37,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:37,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:37,852 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-10-02 12:14:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:37,929 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-10-02 12:14:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:37,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 12:14:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:37,938 INFO L225 Difference]: With dead ends: 143 [2018-10-02 12:14:37,938 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 12:14:37,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 12:14:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 12:14:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 12:14:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-02 12:14:37,962 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-10-02 12:14:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:37,963 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-02 12:14:37,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-02 12:14:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:14:37,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:37,964 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:37,965 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:37,965 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-10-02 12:14:37,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:37,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:37,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:14:38,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:38,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:14:38,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:38,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:38,090 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-02 12:14:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:38,167 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-10-02 12:14:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:38,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-02 12:14:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:38,173 INFO L225 Difference]: With dead ends: 249 [2018-10-02 12:14:38,173 INFO L226 Difference]: Without dead ends: 167 [2018-10-02 12:14:38,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-02 12:14:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-02 12:14:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-02 12:14:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-10-02 12:14:38,213 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-10-02 12:14:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:38,214 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-10-02 12:14:38,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-10-02 12:14:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:14:38,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:38,216 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:38,216 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:38,217 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-10-02 12:14:38,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:38,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:14:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:14:38,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:38,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:38,326 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-10-02 12:14:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:38,484 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-10-02 12:14:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:38,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-02 12:14:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:38,488 INFO L225 Difference]: With dead ends: 489 [2018-10-02 12:14:38,488 INFO L226 Difference]: Without dead ends: 327 [2018-10-02 12:14:38,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-02 12:14:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-02 12:14:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-02 12:14:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-10-02 12:14:38,591 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-10-02 12:14:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:38,592 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-10-02 12:14:38,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-10-02 12:14:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:14:38,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:38,595 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:14:38,595 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:38,595 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-10-02 12:14:38,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:38,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:14:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:14:38,763 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 12:14:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:38,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:14:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:14:39,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:14:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 12:14:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:14:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:14:39,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:39,507 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-10-02 12:14:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:42,518 INFO L93 Difference]: Finished difference Result 737 states and 923 transitions. [2018-10-02 12:14:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:14:42,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-02 12:14:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:42,520 INFO L225 Difference]: With dead ends: 737 [2018-10-02 12:14:42,520 INFO L226 Difference]: Without dead ends: 265 [2018-10-02 12:14:42,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime [2018-10-02 12:14:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-02 12:14:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2018-10-02 12:14:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-02 12:14:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2018-10-02 12:14:42,574 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 26 [2018-10-02 12:14:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:42,574 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2018-10-02 12:14:42,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:14:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2018-10-02 12:14:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:14:42,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:14:42,577 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 12:14:42,577 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:14:42,578 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:14:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 2 times [2018-10-02 12:14:42,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:14:42,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:14:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:14:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:14:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:14:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-02 12:14:42,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:14:42,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:14:42,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:14:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:14:42,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:14:42,688 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. Second operand 3 states. [2018-10-02 12:14:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:14:42,699 INFO L93 Difference]: Finished difference Result 247 states and 286 transitions. [2018-10-02 12:14:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:14:42,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 12:14:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:14:42,700 INFO L225 Difference]: With dead ends: 247 [2018-10-02 12:14:42,700 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:14:42,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:14:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:14:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:14:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:14:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:14:42,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-10-02 12:14:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:14:42,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:14:42,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:14:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:14:42,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:14:42,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:14:43,116 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-02 12:14:43,612 WARN L178 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-02 12:14:44,010 WARN L178 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-02 12:14:44,557 WARN L178 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-02 12:14:44,693 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:14:44,960 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-02 12:14:45,473 WARN L178 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-02 12:14:45,894 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-02 12:14:46,066 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 387) no Hoare annotation was computed. [2018-10-02 12:14:46,067 INFO L421 ceAbstractionStarter]: At program point L320(lines 314 321) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:14:46,067 INFO L421 ceAbstractionStarter]: At program point L384(lines 253 384) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-02 12:14:46,067 INFO L421 ceAbstractionStarter]: At program point L285(lines 285 295) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-02 12:14:46,067 INFO L421 ceAbstractionStarter]: At program point L300(lines 294 301) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-02 12:14:46,067 INFO L421 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:14:46,068 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 361) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse5))) [2018-10-02 12:14:46,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 387) no Hoare annotation was computed. [2018-10-02 12:14:46,068 INFO L421 ceAbstractionStarter]: At program point L381(lines 381 385) the Hoare annotation is: false [2018-10-02 12:14:46,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 387) no Hoare annotation was computed. [2018-10-02 12:14:46,068 INFO L421 ceAbstractionStarter]: At program point L280(lines 271 281) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-02 12:14:46,068 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 382) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~103) (= 0 (+ ~nomsg 1))) [2018-10-02 12:14:46,069 INFO L421 ceAbstractionStarter]: At program point L340(lines 334 341) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:14:46,069 INFO L421 ceAbstractionStarter]: At program point L305(lines 305 315) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-02 12:14:46,069 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 386) no Hoare annotation was computed. [2018-10-02 12:14:46,069 INFO L421 ceAbstractionStarter]: At program point L365(lines 360 366) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~103) (= 0 (+ ~nomsg 1))) [2018-10-02 12:14:46,070 INFO L421 ceAbstractionStarter]: At program point L260(lines 260 272) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-02 12:14:46,081 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,082 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,085 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,088 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,088 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,094 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,095 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,096 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,097 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,098 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,098 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,100 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,100 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,102 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,102 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,104 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,104 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,106 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,106 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,109 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,109 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,114 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,114 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,116 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,116 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,118 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,118 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,121 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:14:46 BoogieIcfgContainer [2018-10-02 12:14:46,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:14:46,122 INFO L168 Benchmark]: Toolchain (without parser) took 10614.05 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.7 MB). Peak memory consumption was 489.4 MB. Max. memory is 7.1 GB. [2018-10-02 12:14:46,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 12:14:46,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 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 12:14:46,125 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 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 12:14:46,126 INFO L168 Benchmark]: RCFGBuilder took 650.23 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 12:14:46,127 INFO L168 Benchmark]: TraceAbstraction took 9871.10 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -21.0 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:14:46,133 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.21 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 43.75 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 40.30 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 650.23 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 9871.10 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -21.0 MB). Peak memory consumption was 457.7 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: 386]: 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: 360]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~103) && 0 == ~nomsg + 1 - InvariantResult [Line: 354]: Loop Invariant [2018-10-02 12:14:46,145 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,145 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,151 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,152 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~103) && 0 == ~nomsg + 1 - InvariantResult [Line: 285]: Loop Invariant [2018-10-02 12:14:46,154 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,154 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,160 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,160 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 314]: Loop Invariant [2018-10-02 12:14:46,162 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,162 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,165 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,165 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 334]: Loop Invariant [2018-10-02 12:14:46,167 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,167 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,172 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,172 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 294]: Loop Invariant [2018-10-02 12:14:46,173 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,173 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,174 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,174 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 305]: Loop Invariant [2018-10-02 12:14:46,177 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,177 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,178 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,178 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 271]: Loop Invariant [2018-10-02 12:14:46,179 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,179 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,180 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 325]: Loop Invariant [2018-10-02 12:14:46,188 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,188 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,190 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:14:46,190 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 9.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 182 SDslu, 170 SDs, 0 SdLazy, 162 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 167 NumberOfFragments, 984 HoareAnnotationTreeSize, 13 FomulaSimplifications, 6601 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 201 ConstructedInterpolants, 8 QuantifiedInterpolants, 17409 SizeOfPredicates, 1 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 108/120 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.4.1.ufo.UNBOUNDED.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-14-46-201.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-14-46-201.csv Received shutdown request...