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.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:48:49,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:48:49,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:48:49,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:48:49,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:48:49,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:48:49,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:48:50,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:48:50,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:48:50,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:48:50,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:48:50,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:48:50,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:48:50,016 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:48:50,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:48:50,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:48:50,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:48:50,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:48:50,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:48:50,025 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:48:50,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:48:50,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:48:50,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:48:50,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:48:50,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:48:50,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:48:50,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:48:50,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:48:50,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:48:50,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:48:50,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:48:50,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:48:50,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:48:50,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:48:50,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:48:50,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:48:50,044 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:50,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:48:50,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:48:50,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:48:50,072 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:48:50,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:48:50,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:48:50,072 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:48:50,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:48:50,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:48:50,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:48:50,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:48:50,163 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:48:50,164 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:48:50,165 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.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:48:50,165 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl' [2018-07-23 13:48:50,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:48:50,244 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:48:50,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:48:50,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:48:50,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:48:50,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:48:50,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:48:50,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:48:50,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:48:50,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/1) ... [2018-07-23 13:48:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:48:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:48:51,144 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:48:51,145 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:51 BoogieIcfgContainer [2018-07-23 13:48:51,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:48:51,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:48:51,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:48:51,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:48:51,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:50" (1/2) ... [2018-07-23 13:48:51,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68657034 and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:48:51, skipping insertion in model container [2018-07-23 13:48:51,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:51" (2/2) ... [2018-07-23 13:48:51,155 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:48:51,164 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:48:51,174 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:48:51,211 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:48:51,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:48:51,212 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:48:51,212 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:48:51,212 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:48:51,212 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:48:51,212 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:48:51,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:48:51,213 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:48:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:48:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:48:51,231 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:51,232 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:48:51,232 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash 990345, now seen corresponding path program 1 times [2018-07-23 13:48:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:51,375 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:51,377 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:48:51,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:48:51,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:51,381 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:51,382 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256)))), 12#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:48:51,382 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:51,383 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:51,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:51,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:51,397 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:48:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:51,451 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:48:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:51,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:48:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:51,466 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:48:51,466 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:48:51,471 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:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:48:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:48:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:48:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:48:51,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:48:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:48:51,515 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:48:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:48:51,516 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:51,517 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:48:51,517 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 951799901, now seen corresponding path program 1 times [2018-07-23 13:48:51,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:51,651 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:51,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:51,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:48:51,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:51,653 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:51,653 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#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:48:51,654 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:51,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:48:51,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:48:51,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:48:51,656 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:48:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:51,763 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:48:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:48:51,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:48:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:51,764 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:48:51,764 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:48:51,766 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:48:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:48:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:48:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:48:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:48:51,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:48:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:51,774 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:48:51,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:48:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:48:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:48:51,776 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:51,776 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:48:51,776 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash -148250831, now seen corresponding path program 2 times [2018-07-23 13:48:51,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:51,950 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:51,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:51,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:48:51,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:51,955 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:51,956 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= 0 ~r1)), 101#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= 0 ~r1)), 102#(and (<= ~r1 1) (= ~mode1 0)), 103#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:48:51,956 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:51,956 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:48:51,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:48:51,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:48:51,958 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 13:48:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:52,047 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:48:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:48:52,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-23 13:48:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:52,048 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:48:52,048 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:48:52,049 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:48:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:48:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:48:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:48:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:48:52,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:48:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:48:52,054 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:48:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:48:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:48:52,055 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:52,056 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:48:52,056 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -735049467, now seen corresponding path program 3 times [2018-07-23 13:48:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:52,265 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:52,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:52,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:48:52,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:52,269 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:52,269 INFO L185 omatonBuilderFactory]: Interpolants [160#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= 0 ~r1)), 161#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= 0 ~r1)), 162#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 163#(and (<= ~r1 1) (<= 1 ~r1)), 164#(= ULTIMATE.start_assert_~arg 1), 158#true, 159#false] [2018-07-23 13:48:52,270 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:52,270 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:48:52,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:48:52,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:48:52,272 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:48:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:52,357 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:48:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:52,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:48:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:52,359 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:48:52,359 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:48:52,360 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:48:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:48:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 13:48:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:48:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:48:52,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:48:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:48:52,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:48:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:48:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:48:52,367 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:52,367 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:48:52,367 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2007822887, now seen corresponding path program 4 times [2018-07-23 13:48:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:48:52,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:52,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:48:52,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:52,481 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:52,482 INFO L185 omatonBuilderFactory]: Interpolants [229#true, 230#false, 231#(= ~mode1 (* 256 (div ~mode1 256))), 232#(and (<= 1 ~mode1) (<= ~mode1 1)), 233#(or (and (= 1 ULTIMATE.start_assert_~arg) (= ~mode1 0)) (= ULTIMATE.start_assert_~arg 0)), 234#(= ~mode1 0), 235#(and (or (= ULTIMATE.start_assert_~arg 0) (<= ~r1 3)) (= ~mode1 0)), 236#(and (<= ~r1 3) (= ~mode1 0)), 237#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:48:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:48:52,482 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:48:52,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:48:52,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:48:52,483 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-07-23 13:48:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:52,560 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:48:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:52,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:48:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:52,562 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:48:52,562 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:48:52,563 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:48:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:48:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:48:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:48:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:48:52,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:48:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:52,569 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:48:52,570 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:48:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:48:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:48:52,570 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:52,571 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:48:52,571 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1077400147, now seen corresponding path program 5 times [2018-07-23 13:48:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-23 13:48:52,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:52,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:48:52,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:52,707 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:52,708 INFO L185 omatonBuilderFactory]: Interpolants [308#true, 309#false, 310#(and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3)), 311#(and (<= 1 ~mode4) (<= ~mode4 1) (not (= ~p3_old ~nomsg)))] [2018-07-23 13:48:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-23 13:48:52,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:52,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:52,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:52,709 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-07-23 13:48:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:52,733 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:48:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:52,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:48:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:52,737 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:48:52,737 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:48:52,739 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:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:48:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:48:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:48:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:48:52,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-07-23 13:48:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:52,743 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:48:52,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:48:52,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:48:52,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:48:52,816 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-07-23 13:48:52,817 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 293) no Hoare annotation was computed. [2018-07-23 13:48:52,817 INFO L417 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-07-23 13:48:52,817 INFO L421 ceAbstractionStarter]: For program point L366(lines 361 367) no Hoare annotation was computed. [2018-07-23 13:48:52,820 INFO L417 ceAbstractionStarter]: At program point L388(lines 255 388) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and .cse0 (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3) .cse1) (and .cse0 (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~mode4 1) .cse1 (not (= ~p3_old ~nomsg))))) [2018-07-23 13:48:52,820 INFO L421 ceAbstractionStarter]: For program point L321(lines 312 322) no Hoare annotation was computed. [2018-07-23 13:48:52,821 INFO L421 ceAbstractionStarter]: For program point L341(lines 335 342) no Hoare annotation was computed. [2018-07-23 13:48:52,821 INFO L421 ceAbstractionStarter]: For program point L326(lines 326 336) no Hoare annotation was computed. [2018-07-23 13:48:52,821 INFO L421 ceAbstractionStarter]: For program point L303(lines 303 313) no Hoare annotation was computed. [2018-07-23 13:48:52,821 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 74 391) the Hoare annotation is: true [2018-07-23 13:48:52,822 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 74 391) the Hoare annotation is: false [2018-07-23 13:48:52,823 INFO L421 ceAbstractionStarter]: For program point L278(lines 272 279) no Hoare annotation was computed. [2018-07-23 13:48:52,823 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-07-23 13:48:52,823 INFO L417 ceAbstractionStarter]: At program point L376(lines 376 383) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~mode4 1) (<= 0 ~r1) (not (= ~p3_old ~nomsg))) [2018-07-23 13:48:52,823 INFO L421 ceAbstractionStarter]: For program point L298(lines 292 299) no Hoare annotation was computed. [2018-07-23 13:48:52,824 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 390) the Hoare annotation is: false [2018-07-23 13:48:52,824 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-07-23 13:48:52,843 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:48:52 BoogieIcfgContainer [2018-07-23 13:48:52,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:48:52,844 INFO L168 Benchmark]: Toolchain (without parser) took 2601.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 180.1 MB). Peak memory consumption was 180.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:52,846 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:52,847 INFO L168 Benchmark]: Boogie Preprocessor took 61.59 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:52,848 INFO L168 Benchmark]: RCFGBuilder took 838.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:52,852 INFO L168 Benchmark]: TraceAbstraction took 1696.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:52,858 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.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 61.59 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 838.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1696.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 376]: Loop Invariant Derived loop invariant: ((((((((~r1 <= 0 && 1 <= ~mode4) && assert_~arg == 1) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~mode4 <= 1) && 0 <= ~r1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((~r1 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && 0 <= ~r1) || (((((((((~r1 <= 0 && 1 <= ~mode4) && assert_~arg == 1) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~mode4 <= 1) && 0 <= ~r1) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 22 SDslu, 34 SDs, 0 SdLazy, 98 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 34/70 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, 115 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 3152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 34/70 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.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-48-52-887.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-48-52-887.csv Received shutdown request...