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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 01:50:32,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 01:50:32,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 01:50:32,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 01:50:32,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 01:50:32,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 01:50:32,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 01:50:32,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 01:50:32,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 01:50:32,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 01:50:32,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 01:50:32,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 01:50:32,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 01:50:32,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 01:50:32,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 01:50:32,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 01:50:32,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 01:50:32,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 01:50:32,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 01:50:33,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 01:50:33,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 01:50:33,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 01:50:33,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 01:50:33,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 01:50:33,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 01:50:33,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 01:50:33,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 01:50:33,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 01:50:33,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 01:50:33,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 01:50:33,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 01:50:33,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 01:50:33,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 01:50:33,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 01:50:33,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 01:50:33,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 01:50:33,013 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-01 01:50:33,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 01:50:33,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 01:50:33,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 01:50:33,044 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 01:50:33,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 01:50:33,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 01:50:33,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 01:50:33,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 01:50:33,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 01:50:33,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 01:50:33,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 01:50:33,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 01:50:33,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 01:50:33,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 01:50:33,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 01:50:33,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 01:50:33,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 01:50:33,049 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 01:50:33,049 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 01:50:33,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 01:50:33,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 01:50:33,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 01:50:33,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 01:50:33,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 01:50:33,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 01:50:33,052 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 01:50:33,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 01:50:33,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 01:50:33,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 01:50:33,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 01:50:33,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 01:50:33,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 01:50:33,137 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 01:50:33,137 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 01:50:33,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-01 01:50:33,138 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-10-01 01:50:33,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 01:50:33,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 01:50:33,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 01:50:33,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 01:50:33,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 01:50:33,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 01:50:33,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 01:50:33,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 01:50:33,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 01:50:33,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 01:50:33,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 01:50:33,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 01:50:33,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 01:50:33,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:50:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 01:50:33,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 01:50:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 01:50:33,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 01:50:33,627 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 01:50:33,627 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:50:33 BoogieIcfgContainer [2018-10-01 01:50:33,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 01:50:33,628 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 01:50:33,628 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 01:50:33,640 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 01:50:33,640 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:50:33" (1/1) ... [2018-10-01 01:50:33,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 01:50:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 5 states and 7 transitions. [2018-10-01 01:50:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-10-01 01:50:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 01:50:33,699 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 6 states and 8 transitions. [2018-10-01 01:50:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2018-10-01 01:50:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 01:50:33,994 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 8 states and 13 transitions. [2018-10-01 01:50:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-10-01 01:50:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 01:50:34,639 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 9 states and 16 transitions. [2018-10-01 01:50:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-10-01 01:50:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 01:50:34,914 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 10 states and 19 transitions. [2018-10-01 01:50:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 19 transitions. [2018-10-01 01:50:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 01:50:35,252 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 11 states and 22 transitions. [2018-10-01 01:50:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2018-10-01 01:50:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 01:50:35,822 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 12 states and 25 transitions. [2018-10-01 01:50:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 25 transitions. [2018-10-01 01:50:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 01:50:36,086 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 13 states and 28 transitions. [2018-10-01 01:50:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2018-10-01 01:50:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 01:50:36,330 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 14 states and 31 transitions. [2018-10-01 01:50:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 31 transitions. [2018-10-01 01:50:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 01:50:36,734 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 15 states and 34 transitions. [2018-10-01 01:50:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 34 transitions. [2018-10-01 01:50:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 01:50:36,995 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 16 states and 37 transitions. [2018-10-01 01:50:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 37 transitions. [2018-10-01 01:50:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 01:50:37,256 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:50:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 17 states and 39 transitions. [2018-10-01 01:50:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 39 transitions. [2018-10-01 01:50:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 01:50:37,538 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-01 01:50:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 29 states and 62 transitions. [2018-10-01 01:50:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 62 transitions. [2018-10-01 01:50:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 01:50:40,062 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-01 01:50:40,863 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-01 01:50:42,101 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-01 01:50:42,430 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-01 01:50:42,687 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-01 01:50:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 28 states and 41 transitions. [2018-10-01 01:50:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2018-10-01 01:50:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-01 01:50:45,372 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-01 01:50:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 40 states and 64 transitions. [2018-10-01 01:50:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2018-10-01 01:50:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 01:50:47,982 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-01 01:50:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 40 states and 54 transitions. [2018-10-01 01:50:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-10-01 01:50:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 01:50:51,254 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-01 01:50:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 52 states and 77 transitions. [2018-10-01 01:50:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2018-10-01 01:50:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 01:50:54,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-10-01 01:50:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:50:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 52 states and 67 transitions. [2018-10-01 01:50:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2018-10-01 01:50:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 01:50:59,032 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:50:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:50:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-01 01:51:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 64 states and 90 transitions. [2018-10-01 01:51:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2018-10-01 01:51:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 01:51:03,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2018-10-01 01:51:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 64 states and 80 transitions. [2018-10-01 01:51:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2018-10-01 01:51:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 01:51:08,656 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-01 01:51:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 76 states and 103 transitions. [2018-10-01 01:51:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2018-10-01 01:51:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 01:51:13,714 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 6 proven. 55 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2018-10-01 01:51:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 76 states and 93 transitions. [2018-10-01 01:51:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-10-01 01:51:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 01:51:19,133 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-01 01:51:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 88 states and 116 transitions. [2018-10-01 01:51:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2018-10-01 01:51:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 01:51:25,386 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 2166 trivial. 0 not checked. [2018-10-01 01:51:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 88 states and 106 transitions. [2018-10-01 01:51:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-10-01 01:51:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-01 01:51:32,255 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-01 01:51:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 100 states and 129 transitions. [2018-10-01 01:51:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2018-10-01 01:51:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-01 01:51:38,926 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 2954 trivial. 0 not checked. [2018-10-01 01:51:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 100 states and 119 transitions. [2018-10-01 01:51:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-10-01 01:51:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-01 01:51:46,173 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 01:51:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 112 states and 142 transitions. [2018-10-01 01:51:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2018-10-01 01:51:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-01 01:51:54,531 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 9 proven. 88 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2018-10-01 01:52:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:52:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 112 states and 132 transitions. [2018-10-01 01:52:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-10-01 01:52:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-01 01:52:02,854 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:52:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:52:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-01 01:52:07,464 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-01 01:52:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:52:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 124 states and 144 transitions. [2018-10-01 01:52:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2018-10-01 01:52:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-01 01:52:12,053 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:52:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:52:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2018-10-01 01:52:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:52:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 124 states and 134 transitions. [2018-10-01 01:52:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-01 01:52:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-01 01:52:20,779 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:52:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:53:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 01:56:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:56:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 122 states and 132 transitions. [2018-10-01 01:56:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-01 01:56:46,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 01:56:46,355 WARN L420 CodeCheckObserver]: This Program is SAFE, Check terminated with 0 iterations. [2018-10-01 01:56:46,366 INFO L776 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-01 01:56:46,463 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 01:56:46 ImpRootNode [2018-10-01 01:56:46,464 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 01:56:46,468 INFO L168 Benchmark]: Toolchain (without parser) took 373274.47 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 651.2 MB. Max. memory is 7.1 GB. [2018-10-01 01:56:46,471 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:56:46,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:56:46,472 INFO L168 Benchmark]: Boogie Preprocessor took 23.39 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:56:46,474 INFO L168 Benchmark]: RCFGBuilder took 367.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 01:56:46,475 INFO L168 Benchmark]: CodeCheck took 372835.64 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 630.1 MB. Max. memory is 7.1 GB. [2018-10-01 01:56:46,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 372.6s OverallTime, 31 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 536870912 SDtfs, 19223860 SDslu, 0 SDs, 0 SdLazy, -459450398 SolverSat, -510830834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.1s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.1s InterpolantComputationTime, 1373 NumberOfCodeBlocks, 1373 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1343 ConstructedInterpolants, 0 QuantifiedInterpolants, 396903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 25749/41094 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && 33 <= main_~k~5) || ((((60 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 1 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 59 <= main_~k~5) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5)) || ((((70 <= main_~k~5 && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && main_~i~5 + 9 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || (((((main_~j~5 + 2 <= main_~m~5 && 78 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~m~5 < main_~j~5 + 4 && 77 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 4)) || (((main_~j~5 + 2 <= main_~m~5 && 98 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 2)) || (((((main_~m~5 < main_~j~5 + 7 && main_~i~5 + 9 <= main_~n~5) && 14 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((((main_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && 60 <= main_~k~5) && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && 25 <= main_~k~5) && main_~m~5 < main_~j~5 + 6) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((((main_~m~5 < main_~j~5 + 4 && 87 <= main_~k~5) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 3 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 3) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~m~5 < main_~j~5 + 9 && main_~n~5 < main_~i~5 + 2) && 92 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || (((((main_~j~5 + 2 <= main_~m~5 && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || ((((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~m~5 < main_~j~5 + 9 && main_~i~5 + 9 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || (((((73 <= main_~k~5 && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~i~5 + 6 <= main_~n~5 && 43 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || (((((76 <= main_~k~5 && main_~m~5 < main_~j~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~i~5 + 9 <= main_~n~5 && main_~m~5 < main_~j~5 + 5) && 16 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 4 && main_~i~5 + 9 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || ((((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || ((100 <= main_~k~5 && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 2)) || (((((main_~j~5 + 1 <= main_~m~5 && 69 <= main_~k~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((((72 <= main_~k~5 && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 4)) || (((((85 <= main_~k~5 && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 3) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5)) || (((((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((((main_~j~5 + 2 <= main_~m~5 && 88 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~m~5 < main_~j~5 + 4) && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || ((90 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 2)) || (((((main_~j~5 + 7 <= main_~m~5 && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((((main_~j~5 + 2 <= main_~m~5 && main_~i~5 + 7 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 3) && 38 <= main_~k~5) && 10 <= main_~m~5)) || (((((main_~j~5 + 1 <= main_~m~5 && 79 <= main_~k~5) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && 31 <= main_~k~5)) || ((((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || ((((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && main_~m~5 < main_~j~5 + 5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || (((((82 <= main_~k~5 && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~n~5 < main_~i~5 + 2) && main_~m~5 < main_~j~5 + 10) && 91 <= main_~k~5)) || (((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 4) && 27 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && main_~m~5 < main_~j~5 + 3) && 10 <= main_~m~5) && 8 <= main_~k~5)) || (((((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 4 && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 67 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 21 <= main_~k~5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 6) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 4 && main_~i~5 + 6 <= main_~n~5) && 47 <= main_~k~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 3 <= main_~m~5)) || ((((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 5) && 26 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && 39 <= main_~k~5)) || (((((main_~j~5 + 9 <= main_~m~5 && 41 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || ((((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 10) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && main_~m~5 < main_~j~5 + 3) && 58 <= main_~k~5) && 10 <= main_~m~5)) || (((((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 6) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || (((((64 <= main_~k~5 && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 6 <= main_~m~5)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || (((main_~m~5 < main_~j~5 + 7 && main_~n~5 < main_~i~5 + 2) && 94 <= main_~k~5) && main_~j~5 + 6 <= main_~m~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && main_~i~5 + 5 <= main_~n~5) && 57 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || ((((main_~i~5 + 10 <= main_~n~5 && main_~m~5 < main_~j~5 + 6) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || (((main_~m~5 < main_~j~5 + 4 && main_~n~5 < main_~i~5 + 2) && 97 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || ((((main_~n~5 < main_~i~5 + 6 && 50 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 9 && 42 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 8 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 6 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4) && 75 <= main_~k~5)) || (((((main_~n~5 < main_~i~5 + 6 && 54 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || (((((main_~m~5 < main_~j~5 + 5 && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 4 <= main_~m~5) && 86 <= main_~k~5)) || (((main_~m~5 < main_~j~5 + 6 && main_~n~5 < main_~i~5 + 2) && main_~j~5 + 5 <= main_~m~5) && 95 <= main_~k~5)) || ((((main_~m~5 < main_~j~5 + 1 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 5) && 36 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 9 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5)) || (((((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5)) || ((((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || (((((main_~j~5 + 2 <= main_~m~5 && main_~m~5 < main_~j~5 + 3) && main_~i~5 + 6 <= main_~n~5) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || ((((90 <= main_~k~5 && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && main_~m~5 < main_~j~5 + 2) && 99 <= main_~k~5) && main_~n~5 < main_~i~5 + 2)) || (((((main_~m~5 < main_~j~5 + 7 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5) && 44 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5)) || (((((main_~j~5 + 2 <= main_~m~5 && main_~i~5 + 8 <= main_~n~5) && 28 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((((65 <= main_~k~5 && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((((main_~n~5 < main_~i~5 + 6 && 56 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~m~5 < main_~j~5 + 5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((((main_~j~5 + 10 <= main_~m~5 && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || (((((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && 34 <= main_~k~5) && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || (((main_~m~5 < main_~j~5 + 5 && main_~n~5 < main_~i~5 + 2) && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((((main_~m~5 < main_~j~5 + 9 && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5) && 30 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~j~5 + 1 <= main_~m~5 && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && 49 <= main_~k~5)) || (((((main_~j~5 + 7 <= main_~m~5 && main_~n~5 < main_~i~5 + 5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5)) || (((((84 <= main_~k~5 && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 6 <= main_~m~5)) || (((((74 <= main_~k~5 && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 4)) || (((((main_~m~5 < main_~j~5 + 5 && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5) && main_~j~5 + 4 <= main_~m~5)) || (((((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((((main_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5) && main_~m~5 < main_~j~5 + 6) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || (((((main_~n~5 < main_~i~5 + 6 && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5)) || (((((46 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && main_~n~5 < main_~i~5 + 2) && main_~m~5 < main_~j~5 + 8) && 93 <= main_~k~5)) || (((((main_~m~5 < main_~j~5 + 4 && main_~i~5 + 7 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 10 <= main_~m~5) && 37 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~n~5 < main_~i~5 + 2) && 10 <= main_~m~5) || (((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~n~5 < main_~i~5 + 3 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7)) || (((main_~n~5 < main_~i~5 + 6 && 50 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && main_~n~5 < main_~i~5 + 1)) || (((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 4)) || (((60 <= main_~k~5 && main_~n~5 < main_~i~5 + 5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.39 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 367.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 372835.64 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 630.1 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-01_01-56-46-511.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-01_01-56-46-511.csv Received shutdown request...