java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.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-935f392 [2018-07-23 13:48:55,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:48:55,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:48:55,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:48:55,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:48:55,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:48:55,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:48:55,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:48:55,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:48:55,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:48:55,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:48:55,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:48:55,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:48:55,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:48:55,180 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:48:55,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:48:55,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:48:55,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:48:55,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:48:55,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:48:55,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:48:55,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:48:55,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:48:55,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:48:55,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:48:55,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:48:55,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:48:55,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:48:55,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:48:55,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:48:55,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:48:55,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:48:55,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:48:55,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:48:55,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:48:55,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:48:55,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:48:55,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:48:55,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:48:55,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:48:55,231 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:48:55,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:48:55,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:48:55,231 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:48:55,232 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:48:55,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:48:55,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:48:55,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:48:55,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:48:55,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:48:55,302 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-07-23 13:48:55,302 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-07-23 13:48:55,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:48:55,405 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:48:55,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:48:55,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:48:55,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:48:55,426 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,428 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,442 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,442 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,458 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,462 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,466 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:48:55,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:48:55,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:48:55,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:48:55,475 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 23.07 01:48:55" (1/1) ... [2018-07-23 13:48:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:48:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:48:56,269 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:48:56,271 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 23.07 01:48:56 BoogieIcfgContainer [2018-07-23 13:48:56,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:48:56,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:48:56,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:48:56,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:48:56,280 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 23.07 01:48:55" (1/2) ... [2018-07-23 13:48:56,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6f5fed 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 23.07 01:48:56, skipping insertion in model container [2018-07-23 13:48:56,281 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 23.07 01:48:56" (2/2) ... [2018-07-23 13:48:56,284 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-07-23 13:48:56,295 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:48:56,305 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:48:56,362 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:48:56,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:48:56,363 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:48:56,363 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:48:56,363 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:48:56,364 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:48:56,364 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:48:56,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:48:56,364 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:48:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:48:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:48:56,393 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:56,394 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:48:56,394 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 990345, now seen corresponding path program 1 times [2018-07-23 13:48:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,597 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:48:56,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:48:56,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,600 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 12#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:48:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,602 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:56,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:56,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:56,620 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:48:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:56,675 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:48:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:56,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:48:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:56,688 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:48:56,689 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:48:56,692 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:48:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:48:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:48:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:48:56,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:48:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:56,730 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:48:56,730 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:48:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:48:56,731 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:56,731 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:48:56,732 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash 951799901, now seen corresponding path program 1 times [2018-07-23 13:48:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:56,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:48:56,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,900 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 52#(and (or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (* 256 (div ~r1 256))))) (<= 1 ~mode1) (<= ~mode1 1)), 53#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256)))), 54#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:56,903 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:48:56,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:48:56,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:48:56,904 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:48:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:56,985 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:48:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:48:56,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:48:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:56,986 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:48:56,986 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:48:56,988 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:48:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:48:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:48:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:48:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:48:56,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:48:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:56,992 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:48:56,992 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:48:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:48:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:48:56,993 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:56,993 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:48:56,994 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash -148250831, now seen corresponding path program 2 times [2018-07-23 13:48:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:57,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:48:57,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,252 INFO L185 omatonBuilderFactory]: Interpolants [99#true, 100#false, 101#(and (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode4 (* 256 (div ~mode4 256)))), 102#(or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 3)))), 103#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 3))), 104#(or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (< 0 (+ (div ~r1 256) 1)) (<= ~r1 (+ (* 256 (div ~r1 256)) 3)) (<= (div ~r1 256) 0) (= ~mode1 0))), 105#(and (< 0 (+ (div ~r1 256) 1)) (<= ~r1 (+ (* 256 (div ~r1 256)) 3)) (<= (div ~r1 256) 0) (= ~mode1 0)), 106#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:48:57,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:48:57,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:48:57,257 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:48:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:57,414 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:48:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:57,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:48:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:57,416 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:48:57,416 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:48:57,417 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:48:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:48:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:48:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:48:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:48:57,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:48:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:48:57,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:48:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:48:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:48:57,430 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:57,430 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:48:57,431 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash -735049467, now seen corresponding path program 3 times [2018-07-23 13:48:57,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:57,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:48:57,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,566 INFO L185 omatonBuilderFactory]: Interpolants [160#(or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256))))), 161#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256)))), 162#(and (<= ~r1 (+ (* 256 (div (+ ~r1 (- 1)) 256)) 1)) (= ~mode1 0)), 163#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 1))), 164#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 157#true, 158#false, 159#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256))))] [2018-07-23 13:48:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:57,567 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:48:57,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:48:57,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:48:57,570 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-07-23 13:48:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:57,685 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:48:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:57,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:48:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:57,686 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:48:57,686 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:48:57,687 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:48:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:48:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:48:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:48:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:48:57,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-07-23 13:48:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:57,694 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:48:57,694 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:48:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:48:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:48:57,695 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:57,695 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:48:57,696 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1077400147, now seen corresponding path program 4 times [2018-07-23 13:48:57,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:58,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:58,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:48:58,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:58,007 INFO L185 omatonBuilderFactory]: Interpolants [240#(and (<= (* 256 (div (+ ~r1 255) 256)) ~r1) (<= 1 ~mode1) (<= ~mode1 1)), 241#(and (<= (+ (* 256 (div (+ ~r1 254) 256)) 1) ~r1) (<= ~r1 4) (= ~mode1 0) (<= 1 ~r1)), 242#(and (= ~mode1 1) (<= (+ (* 256 (div (+ ~r1 254) 256)) 1) ~r1) (<= (div ~r1 256) 0) (<= 1 ~r1)), 243#(or (= ULTIMATE.start_assert_~arg 0) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 2 ~r1) (<= (div ~r1 256) 0) (= ~mode1 0))), 244#(and (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 2 ~r1) (<= (div ~r1 256) 0) (= ~mode1 0)), 245#(or (and (<= ~r1 2) (<= 1 ~mode1) (<= ~mode1 1) (< 0 (+ (div ~r1 256) 1))) (= ULTIMATE.start_assert_~arg 0)), 246#(and (<= ~r1 2) (<= 1 ~mode1) (<= ~mode1 1) (< 0 (+ (div ~r1 256) 1))), 247#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 237#true, 238#false, 239#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256))))] [2018-07-23 13:48:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:58,008 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:48:58,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:48:58,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:48:58,009 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2018-07-23 13:48:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:58,205 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:48:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:48:58,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-07-23 13:48:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:58,207 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:48:58,209 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:48:58,210 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:48:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:48:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-07-23 13:48:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:48:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:48:58,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-07-23 13:48:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:58,220 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:48:58,221 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:48:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:48:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:48:58,221 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:58,222 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:48:58,222 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash 602783317, now seen corresponding path program 5 times [2018-07-23 13:48:58,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:48:58,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:58,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:48:58,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:58,398 INFO L185 omatonBuilderFactory]: Interpolants [340#true, 341#false, 342#(and (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1))), 343#(and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1))] [2018-07-23 13:48:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:48:58,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:58,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:58,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:58,400 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2018-07-23 13:48:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:58,416 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:48:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:58,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-07-23 13:48:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:58,418 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:48:58,418 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:48:58,419 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:48:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:48:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:48:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:48:58,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-07-23 13:48:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:48:58,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:48:58,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:48:58,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:48:58,503 INFO L421 ceAbstractionStarter]: For program point L285(lines 285 295) no Hoare annotation was computed. [2018-07-23 13:48:58,503 INFO L421 ceAbstractionStarter]: For program point L340(lines 334 341) no Hoare annotation was computed. [2018-07-23 13:48:58,505 INFO L417 ceAbstractionStarter]: At program point L384(lines 253 384) the Hoare annotation is: (let ((.cse0 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (not (= ~p1_old ~nomsg)) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) .cse0) (and (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1)) .cse0 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-07-23 13:48:58,505 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 272) no Hoare annotation was computed. [2018-07-23 13:48:58,505 INFO L417 ceAbstractionStarter]: At program point L381(lines 381 385) the Hoare annotation is: false [2018-07-23 13:48:58,505 INFO L421 ceAbstractionStarter]: For program point L300(lines 294 301) no Hoare annotation was computed. [2018-07-23 13:48:58,506 INFO L421 ceAbstractionStarter]: For program point L365(lines 360 366) no Hoare annotation was computed. [2018-07-23 13:48:58,506 INFO L421 ceAbstractionStarter]: For program point L320(lines 314 321) no Hoare annotation was computed. [2018-07-23 13:48:58,506 INFO L421 ceAbstractionStarter]: For program point L325(lines 325 335) no Hoare annotation was computed. [2018-07-23 13:48:58,506 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 315) no Hoare annotation was computed. [2018-07-23 13:48:58,509 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 74 387) the Hoare annotation is: true [2018-07-23 13:48:58,509 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 74 387) the Hoare annotation is: false [2018-07-23 13:48:58,509 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 361) no Hoare annotation was computed. [2018-07-23 13:48:58,510 INFO L417 ceAbstractionStarter]: At program point L375(lines 375 382) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 (* 256 (div ~r1 256)))) [2018-07-23 13:48:58,510 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 386) the Hoare annotation is: false [2018-07-23 13:48:58,510 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 387) no Hoare annotation was computed. [2018-07-23 13:48:58,510 INFO L421 ceAbstractionStarter]: For program point L280(lines 271 281) no Hoare annotation was computed. [2018-07-23 13:48:58,525 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 23.07 01:48:58 BoogieIcfgContainer [2018-07-23 13:48:58,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:48:58,527 INFO L168 Benchmark]: Toolchain (without parser) took 3123.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 274.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:58,529 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:48:58,530 INFO L168 Benchmark]: Boogie Preprocessor took 65.03 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-07-23 13:48:58,531 INFO L168 Benchmark]: RCFGBuilder took 798.46 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:58,532 INFO L168 Benchmark]: TraceAbstraction took 2253.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:58,537 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.03 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 798.46 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2253.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. * 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: 381]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 256 * (~r1 / 256) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((0 <= ~send1 && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 2.1s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 22 SDslu, 43 SDs, 0 SdLazy, 166 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 55/106 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 99 HoareAnnotationTreeSize, 6 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 6400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 55/106 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_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-48-58-558.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_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-48-58-558.csv Received shutdown request...