java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:18,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:18,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:18,884 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:18,884 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:18,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:18,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:18,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:18,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:18,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:18,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:18,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:18,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:18,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:18,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:18,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:18,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:18,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:18,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:18,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:18,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:18,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:18,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:18,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:18,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:18,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:18,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:18,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:18,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:18,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:18,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:18,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:18,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:18,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:18,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:18,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:18,919 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:18,933 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:18,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:18,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:18,935 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:18,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:18,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:18,936 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:18,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:18,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:18,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:19,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:19,004 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:19,004 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:19,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl [2018-07-23 13:49:19,005 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl' [2018-07-23 13:49:19,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:19,087 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:19,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:19,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:19,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:19,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:19,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:19,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:19,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:19,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/1) ... [2018-07-23 13:49:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:20,056 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:20,057 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:20 BoogieIcfgContainer [2018-07-23 13:49:20,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:20,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:20,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:20,062 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:20,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:19" (1/2) ... [2018-07-23 13:49:20,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c668ff7 and model type pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:20, skipping insertion in model container [2018-07-23 13:49:20,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:20" (2/2) ... [2018-07-23 13:49:20,066 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl [2018-07-23 13:49:20,076 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:20,084 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:20,134 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:20,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:20,135 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:20,136 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:20,136 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:20,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:20,136 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:20,136 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:20,137 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:49:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:49:20,163 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:20,165 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:49:20,166 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1001172, now seen corresponding path program 1 times [2018-07-23 13:49:20,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:20,353 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:20,356 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:20,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:20,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:20,359 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:20,359 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256)))), 12#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:20,360 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:20,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:20,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:20,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:20,380 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:49:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:20,448 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:49:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:20,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:49:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:20,463 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:49:20,463 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:49:20,466 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:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:49:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:49:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:49:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:49:20,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:49:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:20,503 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:49:20,504 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:49:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:49:20,505 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:20,505 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:49:20,505 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 962207787, now seen corresponding path program 1 times [2018-07-23 13:49:20,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:20,636 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:20,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:20,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:20,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:20,637 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:20,639 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 52#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 53#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:20,640 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:20,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:20,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:20,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:20,645 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:49:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:20,756 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:49:20,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:20,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:49:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:20,758 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:49:20,758 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:49:20,759 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:49:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:49:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:49:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:49:20,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:49:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:49:20,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:49:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:49:20,764 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:20,765 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:49:20,765 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1263796162, now seen corresponding path program 2 times [2018-07-23 13:49:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:20,905 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:20,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:20,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:20,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:20,907 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:20,907 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 101#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 102#(and (<= ~r1 1) (= ~mode1 0)), 103#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:20,907 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:20,908 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:20,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:20,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:20,912 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 13:49:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:20,996 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:49:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:49:20,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-23 13:49:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:20,997 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:49:20,997 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:49:20,998 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:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:49:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:49:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:49:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:49:21,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:49:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:21,003 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:49:21,003 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:49:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:21,004 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:21,004 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:49:21,006 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:21,006 INFO L82 PathProgramCache]: Analyzing trace with hash -967551591, now seen corresponding path program 3 times [2018-07-23 13:49:21,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:21,165 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:21,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:21,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:21,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:21,166 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:21,167 INFO L185 omatonBuilderFactory]: Interpolants [160#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 161#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 162#(and (<= ~r1 1) (<= 0 ~r1) (= ~mode1 0)), 163#(and (<= 0 (+ ~r1 1)) (<= ~r1 1)), 164#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 158#true, 159#false] [2018-07-23 13:49:21,167 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:21,171 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:21,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:21,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:21,172 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:49:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:21,299 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:49:21,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:21,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:49:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:21,301 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:49:21,301 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:49:21,302 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:49:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 13:49:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:49:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:49:21,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:49:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:21,308 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:49:21,309 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:49:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:49:21,310 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:21,310 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:49:21,310 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2104061520, now seen corresponding path program 4 times [2018-07-23 13:49:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:21,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:21,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:21,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:21,452 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:21,453 INFO L185 omatonBuilderFactory]: Interpolants [229#true, 230#false, 231#(= ~mode1 (* 256 (div ~mode1 256))), 232#(and (<= 1 ~mode1) (<= ~mode1 1)), 233#(= ~mode1 0), 234#(and (or (= ULTIMATE.start_assert_~arg 0) (<= ~r1 4)) (= ~mode1 0)), 235#(and (<= ~r1 4) (= ~mode1 0)), 236#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:21,454 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:49:21,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:49:21,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:49:21,455 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-07-23 13:49:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:21,532 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:49:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:21,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:49:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:21,533 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:49:21,533 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:49:21,534 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:49:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:49:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:49:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:49:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:49:21,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:49:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:21,542 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:49:21,542 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:49:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:49:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:21,543 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:21,543 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:49:21,544 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 926557191, now seen corresponding path program 5 times [2018-07-23 13:49:21,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:21,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:21,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:49:21,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:21,739 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:21,740 INFO L185 omatonBuilderFactory]: Interpolants [304#false, 305#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 306#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 307#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 308#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)), 309#(and (<= ~r1 2) (<= 2 ~r1) (= ~mode1 0)), 310#(and (<= ~r1 2) (<= 1 ~mode1) (<= ~mode1 1) (<= 2 ~r1)), 311#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 303#true] [2018-07-23 13:49:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:21,740 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:49:21,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:49:21,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:49:21,742 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-07-23 13:49:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:21,946 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:49:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:49:21,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-23 13:49:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:21,947 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:49:21,947 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:49:21,948 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:49:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:49:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-07-23 13:49:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:49:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:49:21,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-07-23 13:49:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:21,954 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:49:21,954 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:49:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:49:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:49:21,955 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:21,955 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:49:21,956 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 177671029, now seen corresponding path program 6 times [2018-07-23 13:49:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:22,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:22,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:49:22,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:22,091 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:22,091 INFO L185 omatonBuilderFactory]: Interpolants [404#true, 405#false, 406#(and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3)), 407#(and (<= 1 ~mode4) (<= ~mode4 1) (not (= ~p3_old ~nomsg)))] [2018-07-23 13:49:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:22,092 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:22,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:22,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:22,093 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2018-07-23 13:49:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:22,109 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:49:22,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:22,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-07-23 13:49:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:22,110 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:49:22,110 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:22,111 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:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:22,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-07-23 13:49:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:22,113 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:22,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:22,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:22,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:22,159 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 391) no Hoare annotation was computed. [2018-07-23 13:49:22,161 INFO L417 ceAbstractionStarter]: At program point L465(lines 310 465) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ~mode4) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) .cse1 (not (= ~p3_old ~nomsg))) (and .cse0 (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3) .cse1))) [2018-07-23 13:49:22,161 INFO L421 ceAbstractionStarter]: For program point L333(lines 327 334) no Hoare annotation was computed. [2018-07-23 13:49:22,161 INFO L421 ceAbstractionStarter]: For program point L376(lines 367 377) no Hoare annotation was computed. [2018-07-23 13:49:22,161 INFO L417 ceAbstractionStarter]: At program point L453(lines 453 460) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~r1) (not (= ~p3_old ~nomsg))) [2018-07-23 13:49:22,162 INFO L421 ceAbstractionStarter]: For program point L416(lines 410 417) no Hoare annotation was computed. [2018-07-23 13:49:22,162 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 348) no Hoare annotation was computed. [2018-07-23 13:49:22,162 INFO L417 ceAbstractionStarter]: At program point L459(lines 459 466) the Hoare annotation is: false [2018-07-23 13:49:22,162 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 468) no Hoare annotation was computed. [2018-07-23 13:49:22,162 INFO L421 ceAbstractionStarter]: For program point L443(lines 438 444) no Hoare annotation was computed. [2018-07-23 13:49:22,163 INFO L421 ceAbstractionStarter]: For program point L401(lines 401 411) no Hoare annotation was computed. [2018-07-23 13:49:22,163 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 91 468) the Hoare annotation is: true [2018-07-23 13:49:22,163 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 91 468) the Hoare annotation is: false [2018-07-23 13:49:22,163 INFO L421 ceAbstractionStarter]: For program point L432(lines 432 439) no Hoare annotation was computed. [2018-07-23 13:49:22,163 INFO L421 ceAbstractionStarter]: For program point L353(lines 347 354) no Hoare annotation was computed. [2018-07-23 13:49:22,163 INFO L421 ceAbstractionStarter]: For program point L396(lines 390 397) no Hoare annotation was computed. [2018-07-23 13:49:22,164 INFO L421 ceAbstractionStarter]: For program point L358(lines 358 368) no Hoare annotation was computed. [2018-07-23 13:49:22,164 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 467) the Hoare annotation is: false [2018-07-23 13:49:22,164 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 328) no Hoare annotation was computed. [2018-07-23 13:49:22,177 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:22 BoogieIcfgContainer [2018-07-23 13:49:22,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:22,179 INFO L168 Benchmark]: Toolchain (without parser) took 3092.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:22,181 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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:22,182 INFO L168 Benchmark]: Boogie Preprocessor took 66.63 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:22,183 INFO L168 Benchmark]: RCFGBuilder took 902.29 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:22,184 INFO L168 Benchmark]: TraceAbstraction took 2119.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:22,188 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.16 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 66.63 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 902.29 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 2119.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 467]: 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: 453]: Loop Invariant Derived loop invariant: (((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode4) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 0 <= ~r1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode4) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 0 <= ~r1) && !(~p3_old == ~nomsg)) || (((((((~r1 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 25 SDslu, 48 SDs, 0 SdLazy, 167 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 61/126 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 102 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 5116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 61/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-22-214.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-22-214.csv Received shutdown request...