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.2.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:00,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:00,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:00,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:00,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:00,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:00,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:00,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:00,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:00,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:00,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:00,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:00,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:00,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:00,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:00,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:00,946 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:00,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:00,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:00,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:00,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:00,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:00,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:00,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:00,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:00,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:00,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:00,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:00,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:00,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:00,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:00,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:00,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:00,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:00,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:00,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:00,964 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:00,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:00,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:00,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:00,980 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:00,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:00,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:00,981 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:00,981 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:01,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:01,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:01,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:01,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:01,045 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:01,045 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.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:49:01,046 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl' [2018-07-23 13:49:01,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:01,118 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:01,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:01,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:01,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:01,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:01,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:01,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:01,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:01,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/1) ... [2018-07-23 13:49:01,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:01,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:01,954 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:01,955 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:01 BoogieIcfgContainer [2018-07-23 13:49:01,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:01,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:01,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:01,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:01,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:01" (1/2) ... [2018-07-23 13:49:01,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57596914 and model type pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:01, skipping insertion in model container [2018-07-23 13:49:01,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:01" (2/2) ... [2018-07-23 13:49:01,970 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:49:01,980 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:01,992 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:02,044 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:02,045 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:02,045 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:02,045 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:02,046 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:02,046 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:02,046 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:02,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:02,046 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:49:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:49:02,078 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:02,079 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:49:02,081 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 990345, now seen corresponding path program 1 times [2018-07-23 13:49:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:02,265 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:02,269 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:02,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:02,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:02,272 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:02,273 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:49:02,273 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:02,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:02,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:02,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:02,293 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:49:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:02,354 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:49:02,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:02,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:49:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:02,367 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:49:02,368 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:49:02,371 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:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:49:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:49:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:49:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:49:02,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:49:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:02,409 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:49:02,409 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:49:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:49:02,410 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:02,410 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:49:02,411 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 951799901, now seen corresponding path program 1 times [2018-07-23 13:49:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:02,492 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:02,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:02,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:02,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:02,496 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:02,497 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:49:02,497 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:02,502 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:02,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:02,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:02,503 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:49:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:02,621 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:49:02,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:02,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:49:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:02,623 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:49:02,623 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:49:02,624 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:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:49:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:49:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:49:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:49:02,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:49:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:02,629 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:49:02,629 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:49:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:49:02,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:02,632 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:49:02,633 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash -148250831, now seen corresponding path program 2 times [2018-07-23 13:49:02,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:02,783 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:02,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:02,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:02,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:02,786 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:02,787 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 101#(and (= ~mode1 1) (<= ~r1 0) (<= 0 ~r1)), 102#(and (<= ~r1 1) (= ~mode1 0)), 103#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:49:02,787 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:02,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:02,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:02,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:02,791 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 13:49:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:02,917 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:49:02,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:49:02,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-23 13:49:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:02,921 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:49:02,921 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:49:02,922 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:49:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:49:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:49:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:49:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:49:02,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:49:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:02,931 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:49:02,932 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:49:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:02,932 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:02,933 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:49:02,933 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash -735049467, now seen corresponding path program 3 times [2018-07-23 13:49:02,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:03,116 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:03,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:03,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:03,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:03,119 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:03,119 INFO L185 omatonBuilderFactory]: Interpolants [160#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 161#(and (= ~mode1 1) (<= ~r1 0) (<= 0 ~r1)), 162#(and (<= ~r1 1) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256)))) (= ~mode1 0)), 163#(and (= ~mode1 1) (<= ~r1 1) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256))))), 164#(= ULTIMATE.start_assert_~arg 1), 158#true, 159#false] [2018-07-23 13:49:03,119 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:03,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:03,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:03,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:03,121 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:49:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:03,257 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:49:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:03,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:49:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:03,259 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:49:03,259 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:49:03,260 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:49:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 13:49:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:49:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:49:03,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:49:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:03,275 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:49:03,276 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:49:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:49:03,277 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:03,278 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:49:03,278 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2007822887, now seen corresponding path program 4 times [2018-07-23 13:49:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:03,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:03,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:03,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:03,417 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:03,421 INFO L185 omatonBuilderFactory]: Interpolants [229#true, 230#false, 231#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 232#(and (= ~mode1 1) (<= ~r1 0) (<= 0 ~r1)), 233#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 234#(and (= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)), 235#(and (<= ~r1 2) (= ~mode1 0)), 236#(= ULTIMATE.start_assert_~arg 1)] [2018-07-23 13:49:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:03,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:49:03,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:49:03,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:49:03,423 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-07-23 13:49:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:03,539 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:49:03,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:49:03,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:49:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:03,541 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:49:03,541 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:03,542 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:49:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:49:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:49:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:49:03,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:49:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:49:03,547 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:49:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:49:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:03,548 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:03,549 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:49:03,549 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1077400147, now seen corresponding path program 5 times [2018-07-23 13:49:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:03,659 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:49:03,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:03,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:49:03,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:03,660 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:03,660 INFO L185 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~send4) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))), 314#(and (= ~mode1 1) (not (= ~p4_old ~nomsg)))] [2018-07-23 13:49:03,661 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:49:03,661 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:03,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:03,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:03,662 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-07-23 13:49:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:03,676 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:49:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:03,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:49:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:03,677 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:49:03,678 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:03,678 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:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:03,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-07-23 13:49:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:03,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:03,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:03,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:03,714 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 272) no Hoare annotation was computed. [2018-07-23 13:49:03,715 INFO L421 ceAbstractionStarter]: For program point L321(lines 321 331) no Hoare annotation was computed. [2018-07-23 13:49:03,715 INFO L421 ceAbstractionStarter]: For program point L364(lines 359 365) no Hoare annotation was computed. [2018-07-23 13:49:03,716 INFO L417 ceAbstractionStarter]: At program point L386(lines 254 386) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (= ~mode1 1) .cse0 (= ULTIMATE.start_assert_~arg 1) (not (= ~p4_old ~nomsg)) .cse1) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~send4) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) .cse1))) [2018-07-23 13:49:03,716 INFO L421 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-07-23 13:49:03,717 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 74 389) the Hoare annotation is: true [2018-07-23 13:49:03,717 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 74 389) the Hoare annotation is: false [2018-07-23 13:49:03,717 INFO L421 ceAbstractionStarter]: For program point L296(lines 290 297) no Hoare annotation was computed. [2018-07-23 13:49:03,717 INFO L421 ceAbstractionStarter]: For program point L276(lines 271 277) no Hoare annotation was computed. [2018-07-23 13:49:03,717 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 360) no Hoare annotation was computed. [2018-07-23 13:49:03,718 INFO L417 ceAbstractionStarter]: At program point L374(lines 374 381) the Hoare annotation is: (and (= ~mode1 1) (<= ~r1 0) (= ULTIMATE.start_assert_~arg 1) (not (= ~p4_old ~nomsg)) (<= 0 ~r1)) [2018-07-23 13:49:03,718 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 388) the Hoare annotation is: false [2018-07-23 13:49:03,718 INFO L421 ceAbstractionStarter]: For program point L339(lines 330 340) no Hoare annotation was computed. [2018-07-23 13:49:03,718 INFO L421 ceAbstractionStarter]: For program point L316(lines 310 317) no Hoare annotation was computed. [2018-07-23 13:49:03,719 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 389) no Hoare annotation was computed. [2018-07-23 13:49:03,719 INFO L421 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2018-07-23 13:49:03,719 INFO L417 ceAbstractionStarter]: At program point L380(lines 380 387) the Hoare annotation is: false [2018-07-23 13:49:03,732 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:03 BoogieIcfgContainer [2018-07-23 13:49:03,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:03,733 INFO L168 Benchmark]: Toolchain (without parser) took 2616.51 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:03,735 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:49:03,736 INFO L168 Benchmark]: Boogie Preprocessor took 70.29 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:03,737 INFO L168 Benchmark]: RCFGBuilder took 768.01 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:49:03,738 INFO L168 Benchmark]: TraceAbstraction took 1773.67 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: 158.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:03,742 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 70.29 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 768.01 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 1773.67 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: 158.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 388]: 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: 254]: Loop Invariant Derived loop invariant: ((((~mode1 == 1 && ~r1 <= 0) && assert_~arg == 1) && !(~p4_old == ~nomsg)) && 0 <= ~r1) || ((((((~r1 <= 0 && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~r1 <= 0) && assert_~arg == 1) && !(~p4_old == ~nomsg)) && 0 <= ~r1 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 15 SDslu, 41 SDs, 0 SdLazy, 120 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 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, 29/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, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 71 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 3283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 29/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.2.ufo.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-03-757.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-03-757.csv Received shutdown request...