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.4.ufo.UNBOUNDED.pals.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:00,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:00,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:00,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:00,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:00,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:00,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:00,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:00,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:00,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:00,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:00,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:00,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:00,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:00,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:00,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:00,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:00,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:00,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:00,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:00,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:00,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:00,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:00,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:00,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:00,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:00,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:00,761 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:00,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:00,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:00,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:00,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:00,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:00,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:00,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:00,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:00,765 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:16:00,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:00,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:00,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:00,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:00,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:00,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:00,790 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:00,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:00,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:00,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:00,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:00,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:00,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:00,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:00,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:00,793 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:00,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:00,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:00,793 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:00,793 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:00,794 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:00,794 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:00,794 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:00,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:00,794 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:00,795 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:00,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:00,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:00,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:00,858 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:00,859 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:00,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl [2018-10-02 12:16:00,860 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl' [2018-10-02 12:16:00,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:00,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:00,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:00,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:00,963 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:00,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:01,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:01,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:01,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:01,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/1) ... [2018-10-02 12:16:01,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:01,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:01,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:01,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:01,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (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:16:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:01,775 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:01,775 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:01 BoogieIcfgContainer [2018-10-02 12:16:01,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:01,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:01,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:01,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:01,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:00" (1/2) ... [2018-10-02 12:16:01,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78966abd and model type pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:01, skipping insertion in model container [2018-10-02 12:16:01,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:01" (2/2) ... [2018-10-02 12:16:01,784 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl [2018-10-02 12:16:01,794 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:01,802 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:01,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:01,863 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:01,864 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:01,864 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:01,864 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:01,864 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:01,864 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:01,867 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:01,867 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-02 12:16:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:01,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:01,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:01,906 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:01,912 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-02 12:16:01,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:01,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:02,184 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:16:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:02,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:02,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:02,209 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-02 12:16:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:02,311 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-02 12:16:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:02,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 12:16:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:02,325 INFO L225 Difference]: With dead ends: 48 [2018-10-02 12:16:02,326 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 12:16:02,329 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:16:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 12:16:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-02 12:16:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 12:16:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-02 12:16:02,367 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-02 12:16:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:02,367 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-02 12:16:02,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-02 12:16:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:02,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:02,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:02,369 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:02,369 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:02,369 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-02 12:16:02,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:02,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:02,509 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:16:02,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:02,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:02,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:02,512 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:02,512 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-02 12:16:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:02,609 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-02 12:16:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:02,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 12:16:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:02,614 INFO L225 Difference]: With dead ends: 85 [2018-10-02 12:16:02,614 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 12:16:02,615 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:16:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 12:16:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-02 12:16:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-02 12:16:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-02 12:16:02,634 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-02 12:16:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:02,635 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-02 12:16:02,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-02 12:16:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:02,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:02,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:02,637 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:02,637 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-02 12:16:02,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:02,769 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:16:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:02,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:02,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:02,774 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-02 12:16:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:03,004 INFO L93 Difference]: Finished difference Result 139 states and 197 transitions. [2018-10-02 12:16:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:03,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 12:16:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:03,008 INFO L225 Difference]: With dead ends: 139 [2018-10-02 12:16:03,009 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 12:16:03,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 12:16:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-02 12:16:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-02 12:16:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-10-02 12:16:03,043 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 15 [2018-10-02 12:16:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:03,046 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-10-02 12:16:03,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-10-02 12:16:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:03,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:03,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:03,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:03,049 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 774424133, now seen corresponding path program 1 times [2018-10-02 12:16:03,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:03,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:03,278 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:16:03,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:03,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:16:03,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:03,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:03,280 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 4 states. [2018-10-02 12:16:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:03,464 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2018-10-02 12:16:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:16:03,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-02 12:16:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:03,471 INFO L225 Difference]: With dead ends: 155 [2018-10-02 12:16:03,471 INFO L226 Difference]: Without dead ends: 153 [2018-10-02 12:16:03,472 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:16:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-02 12:16:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2018-10-02 12:16:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-02 12:16:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2018-10-02 12:16:03,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 15 [2018-10-02 12:16:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:03,500 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-10-02 12:16:03,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2018-10-02 12:16:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 12:16:03,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:03,501 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] [2018-10-02 12:16:03,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:03,502 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash 263176883, now seen corresponding path program 1 times [2018-10-02 12:16:03,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:03,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:03,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:03,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:03,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:03,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:03,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:03,680 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand 3 states. [2018-10-02 12:16:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:03,789 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2018-10-02 12:16:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:03,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-02 12:16:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:03,794 INFO L225 Difference]: With dead ends: 267 [2018-10-02 12:16:03,794 INFO L226 Difference]: Without dead ends: 179 [2018-10-02 12:16:03,795 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:16:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-02 12:16:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-02 12:16:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-02 12:16:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-02 12:16:03,843 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 28 [2018-10-02 12:16:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:03,847 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-02 12:16:03,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-02 12:16:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 12:16:03,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:03,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:03,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:03,850 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -437887695, now seen corresponding path program 1 times [2018-10-02 12:16:03,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:03,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:03,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:03,957 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-02 12:16:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:04,139 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-02 12:16:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:04,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-02 12:16:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:04,144 INFO L225 Difference]: With dead ends: 525 [2018-10-02 12:16:04,144 INFO L226 Difference]: Without dead ends: 351 [2018-10-02 12:16:04,146 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:16:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-02 12:16:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-02 12:16:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-02 12:16:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-02 12:16:04,225 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-02 12:16:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:04,225 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-02 12:16:04,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-02 12:16:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 12:16:04,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:04,231 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:04,231 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:04,231 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2082072239, now seen corresponding path program 1 times [2018-10-02 12:16:04,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:04,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:04,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:04,353 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:16:04,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:04,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:16:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 12:16:04,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:16:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:16:04,997 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:04,997 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-10-02 12:16:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:09,660 INFO L93 Difference]: Finished difference Result 791 states and 1017 transitions. [2018-10-02 12:16:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:16:09,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-02 12:16:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:09,662 INFO L225 Difference]: With dead ends: 791 [2018-10-02 12:16:09,663 INFO L226 Difference]: Without dead ends: 287 [2018-10-02 12:16:09,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime [2018-10-02 12:16:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-02 12:16:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2018-10-02 12:16:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-02 12:16:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-10-02 12:16:09,720 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 28 [2018-10-02 12:16:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:09,721 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-10-02 12:16:09,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:16:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-10-02 12:16:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-02 12:16:09,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:09,724 INFO L375 BasicCegarLoop]: trace histogram [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 12:16:09,724 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:09,724 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1799101551, now seen corresponding path program 2 times [2018-10-02 12:16:09,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:09,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:09,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:09,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-02 12:16:09,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:09,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:09,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:09,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:09,824 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 3 states. [2018-10-02 12:16:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:09,835 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2018-10-02 12:16:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:09,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-02 12:16:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:09,835 INFO L225 Difference]: With dead ends: 266 [2018-10-02 12:16:09,836 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:09,836 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:16:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:09,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-02 12:16:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:09,838 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:09,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:09,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:09,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:10,932 WARN L178 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-02 12:16:11,130 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-10-02 12:16:11,260 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:16:11,557 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-02 12:16:11,906 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-02 12:16:12,403 WARN L178 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-02 12:16:12,604 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-02 12:16:13,022 WARN L178 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-10-02 12:16:13,257 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:16:13,421 INFO L421 ceAbstractionStarter]: At program point L316(lines 308 317) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:16:13,422 INFO L421 ceAbstractionStarter]: At program point L250(lines 242 251) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse8 (<= ~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 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse1 .cse2 .cse3) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse7 .cse8 .cse2 .cse3) (and .cse5 .cse0 .cse7 .cse8 .cse1 .cse2 .cse3) (and .cse5 (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~84) .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse4))) [2018-10-02 12:16:13,422 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 370) the Hoare annotation is: false [2018-10-02 12:16:13,422 INFO L421 ceAbstractionStarter]: At program point L255(lines 255 265) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse8 (<= ~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 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse1 .cse2 .cse3) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse7 .cse8 .cse2 .cse3) (and .cse5 .cse0 .cse7 .cse8 .cse1 .cse2 .cse3) (and .cse5 (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~84) .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse4))) [2018-10-02 12:16:13,422 INFO L421 ceAbstractionStarter]: At program point L350(lines 345 351) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-02 12:16:13,422 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 372) no Hoare annotation was computed. [2018-10-02 12:16:13,422 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 372) no Hoare annotation was computed. [2018-10-02 12:16:13,423 INFO L421 ceAbstractionStarter]: At program point L272(lines 264 273) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~84) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6) (and .cse7 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-10-02 12:16:13,423 INFO L421 ceAbstractionStarter]: At program point L330(lines 330 336) 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 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-02 12:16:13,423 INFO L421 ceAbstractionStarter]: At program point L231(lines 231 243) 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:16:13,423 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 372) no Hoare annotation was computed. [2018-10-02 12:16:13,424 INFO L421 ceAbstractionStarter]: At program point L277(lines 277 287) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~84) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6) (and .cse7 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-10-02 12:16:13,424 INFO L421 ceAbstractionStarter]: At program point L339(lines 335 346) 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 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-02 12:16:13,424 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 367) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-02 12:16:13,424 INFO L421 ceAbstractionStarter]: At program point L294(lines 286 295) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:16:13,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 371) no Hoare annotation was computed. [2018-10-02 12:16:13,424 INFO L421 ceAbstractionStarter]: At program point L369(lines 224 369) 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:16:13,425 INFO L421 ceAbstractionStarter]: At program point L299(lines 299 309) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-02 12:16:13,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,448 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,448 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,467 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,468 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,470 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,482 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:16:13 BoogieIcfgContainer [2018-10-02 12:16:13,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:16:13,483 INFO L168 Benchmark]: Toolchain (without parser) took 12526.75 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 62.2 MB). Peak memory consumption was 489.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:13,485 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:13,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:13,486 INFO L168 Benchmark]: Boogie Preprocessor took 54.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:13,487 INFO L168 Benchmark]: RCFGBuilder took 700.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:13,488 INFO L168 Benchmark]: TraceAbstraction took 11705.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.5 MB). Peak memory consumption was 457.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:13,494 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 700.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11705.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.5 MB). Peak memory consumption was 457.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 371]: 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: 242]: Loop Invariant [2018-10-02 12:16:13,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,516 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,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) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~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) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 264]: Loop Invariant [2018-10-02 12:16:13,517 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,517 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,519 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,519 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((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) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 286]: Loop Invariant [2018-10-02 12:16:13,524 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,525 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,525 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,526 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 231]: 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: 330]: Loop Invariant [2018-10-02 12:16:13,527 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,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) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 255]: Loop Invariant [2018-10-02 12:16:13,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,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) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~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) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 277]: Loop Invariant [2018-10-02 12:16:13,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((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) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 335]: Loop Invariant [2018-10-02 12:16:13,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,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) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 299]: Loop Invariant [2018-10-02 12:16:13,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 308]: Loop Invariant [2018-10-02 12:16:13,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-02 12:16:13,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 224]: 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, 18 locations, 1 error locations. SAFE Result, 11.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 199 SDslu, 164 SDs, 0 SdLazy, 212 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 176 NumberOfFragments, 1089 HoareAnnotationTreeSize, 14 FomulaSimplifications, 7424 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 217 ConstructedInterpolants, 8 QuantifiedInterpolants, 19854 SizeOfPredicates, 1 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 118/130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-16-13-558.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.UNBOUNDED.pals.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-16-13-558.csv Received shutdown request...