java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:58,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:58,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:58,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:58,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:58,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:58,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:58,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:58,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:58,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:58,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:58,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:58,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:58,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:58,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:58,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:58,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:58,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:58,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:58,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:58,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:58,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:58,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:58,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:58,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:58,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:58,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:58,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:58,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:58,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:58,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:58,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:58,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:58,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:58,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:58,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:58,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:58,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:58,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:58,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:58,228 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:58,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:58,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:58,228 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:58,229 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:58,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:58,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:58,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:58,292 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:58,293 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:58,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl [2018-09-26 08:06:58,294 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl' [2018-09-26 08:06:58,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:58,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:58,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:58,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:58,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:58,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:58,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:58,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:58,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:58,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:58,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:58,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:58,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:58,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/1) ... [2018-09-26 08:06:58,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:06:58,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:06:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:06:58,676 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:06:58,677 INFO L202 PluginConnector]: Adding new model cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:58 BoogieIcfgContainer [2018-09-26 08:06:58,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:58,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:58,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:58,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:58,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:58" (1/2) ... [2018-09-26 08:06:58,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454deec8 and model type cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:58, skipping insertion in model container [2018-09-26 08:06:58,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:58" (2/2) ... [2018-09-26 08:06:58,687 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl [2018-09-26 08:06:58,696 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:58,703 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:58,744 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:58,745 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:58,745 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:58,745 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:58,745 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:58,746 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:58,746 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:58,746 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:58,746 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:58,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,772 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:58,773 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-09-26 08:06:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:58,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:58,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:06:58,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:06:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:06:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:58,899 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:06:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,924 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-09-26 08:06:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:06:58,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:06:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,937 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:06:58,937 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:06:58,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:06:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:06:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:06:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:06:58,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:06:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,990 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:06:58,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:06:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:06:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:58,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:58,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-09-26 08:06:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:06:59,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:59,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:59,024 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:06:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,044 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:06:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:59,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:06:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,047 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:06:59,048 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:06:59,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:06:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:06:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:59,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:06:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,054 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:59,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:59,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,055 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:59,055 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-09-26 08:06:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:59,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:59,104 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:06:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,133 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:59,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:06:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,138 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:59,138 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:06:59,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:06:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:06:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:06:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:06:59,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:06:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,144 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:06:59,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:06:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:59,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,145 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:06:59,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-09-26 08:06:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:59,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:59,217 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:06:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,233 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:06:59,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:59,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,237 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:06:59,237 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:06:59,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:06:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:06:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:59,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:06:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,245 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:59,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:59,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,247 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:06:59,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-09-26 08:06:59,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:59,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,355 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:06:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,396 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:59,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:06:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,397 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:59,397 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:06:59,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:06:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:06:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:06:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:06:59,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:06:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,402 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:06:59,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:06:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:59,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,403 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:06:59,403 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-09-26 08:06:59,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:59,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:06:59,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,445 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-09-26 08:06:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,459 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:59,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,460 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:59,461 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:06:59,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:06:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:06:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:06:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:06:59,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-09-26 08:06:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:06:59,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:06:59,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:06:59,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:06:59,546 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 37) the Hoare annotation is: false [2018-09-26 08:06:59,546 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 36) the Hoare annotation is: false [2018-09-26 08:06:59,546 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-09-26 08:06:59,547 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-09-26 08:06:59,550 INFO L422 ceAbstractionStarter]: At program point L26(lines 17 27) the Hoare annotation is: (or (let ((.cse0 (+ ULTIMATE.start_main_~i~4 3))) (and (<= .cse0 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~j~4 .cse0) (<= ULTIMATE.start_main_~j~4 8) (<= 8 ULTIMATE.start_main_~j~4))) (let ((.cse1 (+ ULTIMATE.start_main_~i~4 9))) (and (<= 10 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~j~4 10) (<= ULTIMATE.start_main_~j~4 .cse1) (<= .cse1 ULTIMATE.start_main_~j~4))) (and (<= 7 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~j~4 7) (<= ULTIMATE.start_main_~j~4 ULTIMATE.start_main_~i~4)) (and (<= ULTIMATE.start_main_~j~4 6) (<= 6 ULTIMATE.start_main_~j~4) (<= (+ ULTIMATE.start_main_~j~4 3) ULTIMATE.start_main_~i~4)) (let ((.cse2 (+ ULTIMATE.start_main_~i~4 6))) (and (<= .cse2 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~j~4 .cse2) (<= ULTIMATE.start_main_~j~4 9) (<= 9 ULTIMATE.start_main_~j~4)))) [2018-09-26 08:06:59,550 INFO L422 ceAbstractionStarter]: At program point L34(lines 34 35) the Hoare annotation is: false [2018-09-26 08:06:59,566 INFO L202 PluginConnector]: Adding new model cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:06:59 BoogieIcfgContainer [2018-09-26 08:06:59,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:06:59,568 INFO L168 Benchmark]: Toolchain (without parser) took 1210.00 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:59,570 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-09-26 08:06:59,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.15 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-09-26 08:06:59,571 INFO L168 Benchmark]: Boogie Preprocessor took 24.04 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-09-26 08:06:59,573 INFO L168 Benchmark]: RCFGBuilder took 245.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:59,575 INFO L168 Benchmark]: TraceAbstraction took 888.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:59,580 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.26 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 Procedure Inliner took 44.15 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 24.04 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 245.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 888.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: 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: 17]: Loop Invariant Derived loop invariant: ((((((main_~i~4 + 3 <= main_~j~4 && main_~j~4 <= main_~i~4 + 3) && main_~j~4 <= 8) && 8 <= main_~j~4) || (((10 <= main_~j~4 && main_~j~4 <= 10) && main_~j~4 <= main_~i~4 + 9) && main_~i~4 + 9 <= main_~j~4)) || (((7 <= main_~j~4 && main_~i~4 <= main_~j~4) && main_~j~4 <= 7) && main_~j~4 <= main_~i~4)) || ((main_~j~4 <= 6 && 6 <= main_~j~4) && main_~j~4 + 3 <= main_~i~4)) || (((main_~i~4 + 6 <= main_~j~4 && main_~j~4 <= main_~i~4 + 6) && main_~j~4 <= 9) && 9 <= main_~j~4) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 0.8s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 15 SDs, 0 SdLazy, 67 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 81 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 15/35 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/cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-06-59-603.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/cggmp2005.c.i_3.bplTransformedIcfg_BEv2_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-06-59-603.csv Received shutdown request...