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.5.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:14,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:14,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:14,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:14,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:14,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:14,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:14,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:14,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:14,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:14,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:14,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:14,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:14,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:14,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:14,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:14,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:14,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:14,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:14,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:14,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:14,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:14,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:14,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:14,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:14,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:14,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:14,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:14,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:14,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:14,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:14,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:14,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:14,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:14,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:14,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:14,678 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:49:14,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:14,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:14,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:14,706 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:14,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:14,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:14,707 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:14,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:14,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:14,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:14,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:14,805 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:14,806 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:14,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-07-23 13:49:14,808 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-07-23 13:49:14,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:14,904 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:14,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:14,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:14,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:14,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:14,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:15,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:15,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:15,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:15,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:15,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/1) ... [2018-07-23 13:49:15,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:15,953 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:15,954 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:15 BoogieIcfgContainer [2018-07-23 13:49:15,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:15,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:15,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:15,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:15,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:14" (1/2) ... [2018-07-23 13:49:15,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a23969e and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:15, skipping insertion in model container [2018-07-23 13:49:15,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:15" (2/2) ... [2018-07-23 13:49:15,963 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-07-23 13:49:15,972 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:15,981 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:16,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:16,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:16,023 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:16,023 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:16,023 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:16,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:16,024 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:16,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:16,024 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:49:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:49:16,045 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:16,045 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:49:16,046 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1001234, now seen corresponding path program 1 times [2018-07-23 13:49:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:16,225 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:49:16,228 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:16,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:16,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:16,231 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:49:16,232 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256)))), 12#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:16,232 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:49:16,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:16,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:16,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:16,254 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:49:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:16,319 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:49:16,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:16,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:49:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:16,335 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:49:16,335 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:49:16,339 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:49:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:49:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:49:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:49:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:49:16,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:49:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:49:16,377 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:49:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:49:16,378 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:16,378 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:49:16,378 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 962148267, now seen corresponding path program 1 times [2018-07-23 13:49:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:16,499 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:49:16,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:16,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:16,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:16,502 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:49:16,503 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 52#(and (<= ~r1 0) (<= 0 ~r1)), 53#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:16,503 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:49:16,509 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:16,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:16,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:16,512 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:49:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:16,608 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:49:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:16,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:49:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:16,610 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:49:16,610 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:49:16,612 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:49:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:49:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:49:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:49:16,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:49:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:16,620 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:49:16,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:49:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:49:16,621 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:16,621 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:49:16,622 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1206478340, now seen corresponding path program 2 times [2018-07-23 13:49:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:16,811 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:49:16,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:16,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:16,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:16,815 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:49:16,815 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode1 (* 256 (div ~mode1 256)))), 101#(and (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode5) (<= ~mode5 1)), 102#(and (or (= ULTIMATE.start_assert_~arg 0) (<= ~r1 4)) (= ~mode1 0)), 103#(and (<= ~r1 4) (= ~mode1 0)), 104#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:16,816 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:49:16,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:16,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:16,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:16,819 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-23 13:49:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:17,037 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:49:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:17,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:49:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:17,039 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:49:17,039 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:49:17,041 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:49:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:49:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:49:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:49:17,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:49:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:17,049 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:49:17,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:49:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:17,052 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:17,052 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:49:17,052 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash -215522787, now seen corresponding path program 3 times [2018-07-23 13:49:17,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:17,227 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:49:17,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:17,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:17,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:17,228 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:49:17,229 INFO L185 omatonBuilderFactory]: Interpolants [160#false, 161#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 162#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 163#(and (<= ~r1 1) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256)))) (= ~mode1 0)), 164#(and (<= ~r1 1) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256))))), 165#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 159#true] [2018-07-23 13:49:17,229 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:49:17,230 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:17,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:17,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:17,232 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:49:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:17,363 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:49:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:17,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:49:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:17,364 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:49:17,365 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:17,365 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:49:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:49:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:49:17,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-07-23 13:49:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:17,373 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:49:17,373 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:49:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:17,374 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:17,374 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:49:17,374 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1813447567, now seen corresponding path program 4 times [2018-07-23 13:49:17,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:17,667 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:49:17,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:17,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:49:17,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:17,668 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:49:17,669 INFO L185 omatonBuilderFactory]: Interpolants [240#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 241#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 242#(and (<= ~r1 1) (<= 1 ~r1)), 243#(or (and (= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)) (= ~mode1 0)), 244#(or (and (<= ~r1 2) (<= 2 ~r1)) (and (<= 1 ~mode1) (<= ~mode1 1))), 245#(or (and (<= ~r1 2) (<= 1 ~mode1) (<= ~mode1 1) (<= 2 ~r1) (or (= ULTIMATE.start_assert_~arg 0) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 4)))) (and (or (= ULTIMATE.start_assert_~arg 0) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 4))) (= ~mode1 0))), 246#(or (and (<= ~r1 4) (= ~mode1 0)) (and (<= ~r1 2) (<= 1 ~mode1) (<= ~mode1 1) (<= 2 ~r1))), 247#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 238#true, 239#false] [2018-07-23 13:49:17,669 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:49:17,670 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:49:17,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:49:17,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:17,673 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-07-23 13:49:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:17,926 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 13:49:17,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:49:17,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-07-23 13:49:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:17,928 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:49:17,928 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:49:17,929 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:49:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:49:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-07-23 13:49:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:49:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:49:17,940 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-07-23 13:49:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:17,941 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:49:17,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:49:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:49:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:49:17,942 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:17,942 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:49:17,943 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1198220287, now seen corresponding path program 5 times [2018-07-23 13:49:17,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:18,132 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:49:18,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:18,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:49:18,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:18,134 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:49:18,135 INFO L185 omatonBuilderFactory]: Interpolants [346#true, 347#false, 348#(and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))), 349#(and (<= 1 ~mode5) (not (= ~p4_old ~nomsg)) (<= ~mode5 1))] [2018-07-23 13:49:18,136 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:49:18,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:18,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:18,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:18,137 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2018-07-23 13:49:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:18,155 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:49:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:18,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-07-23 13:49:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:18,160 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:49:18,160 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:18,161 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:49:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:18,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-07-23 13:49:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:18,164 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:18,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:18,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:18,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:18,212 INFO L417 ceAbstractionStarter]: At program point L463(lines 463 464) the Hoare annotation is: false [2018-07-23 13:49:18,213 INFO L421 ceAbstractionStarter]: For program point L371(lines 365 372) no Hoare annotation was computed. [2018-07-23 13:49:18,213 INFO L421 ceAbstractionStarter]: For program point L376(lines 376 388) no Hoare annotation was computed. [2018-07-23 13:49:18,213 INFO L421 ceAbstractionStarter]: For program point L331(lines 326 332) no Hoare annotation was computed. [2018-07-23 13:49:18,214 INFO L417 ceAbstractionStarter]: At program point L451(lines 451 460) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode5) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (<= ~mode5 1) (<= 0 ~r1)) [2018-07-23 13:49:18,214 INFO L421 ceAbstractionStarter]: For program point L414(lines 408 415) no Hoare annotation was computed. [2018-07-23 13:49:18,214 INFO L421 ceAbstractionStarter]: For program point L336(lines 336 346) no Hoare annotation was computed. [2018-07-23 13:49:18,216 INFO L417 ceAbstractionStarter]: At program point L459(lines 309 459) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode5) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (<= ~mode5 1) .cse1) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~send4) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) .cse1))) [2018-07-23 13:49:18,216 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 466) no Hoare annotation was computed. [2018-07-23 13:49:18,216 INFO L421 ceAbstractionStarter]: For program point L441(lines 436 442) no Hoare annotation was computed. [2018-07-23 13:49:18,216 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 91 466) the Hoare annotation is: true [2018-07-23 13:49:18,217 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 91 466) the Hoare annotation is: false [2018-07-23 13:49:18,217 INFO L421 ceAbstractionStarter]: For program point L351(lines 345 352) no Hoare annotation was computed. [2018-07-23 13:49:18,217 INFO L421 ceAbstractionStarter]: For program point L394(lines 387 395) no Hoare annotation was computed. [2018-07-23 13:49:18,217 INFO L421 ceAbstractionStarter]: For program point L399(lines 399 409) no Hoare annotation was computed. [2018-07-23 13:49:18,217 INFO L421 ceAbstractionStarter]: For program point L430(lines 430 437) no Hoare annotation was computed. [2018-07-23 13:49:18,217 INFO L421 ceAbstractionStarter]: For program point L356(lines 356 366) no Hoare annotation was computed. [2018-07-23 13:49:18,218 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 465) the Hoare annotation is: false [2018-07-23 13:49:18,218 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 327) no Hoare annotation was computed. [2018-07-23 13:49:18,232 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:18 BoogieIcfgContainer [2018-07-23 13:49:18,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:18,233 INFO L168 Benchmark]: Toolchain (without parser) took 3330.08 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: 264.2 MB). Peak memory consumption was 264.2 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:18,235 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:49:18,236 INFO L168 Benchmark]: Boogie Preprocessor took 96.09 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:49:18,237 INFO L168 Benchmark]: RCFGBuilder took 947.90 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:49:18,238 INFO L168 Benchmark]: TraceAbstraction took 2276.73 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: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:18,243 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.25 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 96.09 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 947.90 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 2276.73 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: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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: 463]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode5) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode5 <= 1) && 0 <= ~r1) || (((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode5) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode5 <= 1) && 0 <= ~r1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 25 SDslu, 41 SDs, 0 SdLazy, 132 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s 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, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 102 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 5175 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.5.2.ufo.BOUNDED-10.pals.c_11.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-18-261.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-18-261.csv Received shutdown request...