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_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 03:21:16,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 03:21:16,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 03:21:16,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 03:21:16,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 03:21:16,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 03:21:16,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 03:21:16,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 03:21:16,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 03:21:16,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 03:21:16,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 03:21:16,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 03:21:16,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 03:21:16,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 03:21:16,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 03:21:16,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 03:21:16,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 03:21:16,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 03:21:16,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 03:21:16,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 03:21:16,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 03:21:16,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 03:21:16,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 03:21:16,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 03:21:16,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 03:21:16,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 03:21:16,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 03:21:16,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 03:21:16,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 03:21:16,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 03:21:16,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 03:21:16,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 03:21:16,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 03:21:16,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 03:21:16,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 03:21:16,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 03:21:16,340 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf [2018-10-01 03:21:16,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 03:21:16,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 03:21:16,365 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 03:21:16,365 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 03:21:16,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 03:21:16,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 03:21:16,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 03:21:16,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 03:21:16,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 03:21:16,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 03:21:16,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 03:21:16,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 03:21:16,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 03:21:16,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 03:21:16,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 03:21:16,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 03:21:16,369 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 03:21:16,370 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 03:21:16,370 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 03:21:16,370 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 03:21:16,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 03:21:16,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 03:21:16,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 03:21:16,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 03:21:16,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 03:21:16,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 03:21:16,372 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 03:21:16,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 03:21:16,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 03:21:16,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 03:21:16,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 03:21:16,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 03:21:16,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 03:21:16,462 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 03:21:16,463 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 03:21:16,465 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 03:21:16,466 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 03:21:16,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 03:21:16,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 03:21:16,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 03:21:16,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 03:21:16,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 03:21:16,557 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,571 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 03:21:16,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 03:21:16,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 03:21:16,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 03:21:16,593 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,593 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,594 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,595 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,599 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,602 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,604 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 03:21:16,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 03:21:16,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 03:21:16,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 03:21:16,608 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 03:21:16" (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 03:21:16,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 03:21:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 03:21:16,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 03:21:16,929 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 03:21:16,930 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 03:21:16 BoogieIcfgContainer [2018-10-01 03:21:16,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 03:21:16,930 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 03:21:16,931 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 03:21:16,942 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 03:21:16,942 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 03:21:16" (1/1) ... [2018-10-01 03:21:16,956 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 03:21:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 5 states and 7 transitions. [2018-10-01 03:21:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-10-01 03:21:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 03:21:16,991 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:17,147 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 03:21:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 6 states and 8 transitions. [2018-10-01 03:21:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2018-10-01 03:21:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 03:21:17,460 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:17,554 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 03:21:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 8 states and 13 transitions. [2018-10-01 03:21:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-10-01 03:21:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 03:21:18,444 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:18,502 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 03:21:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 9 states and 16 transitions. [2018-10-01 03:21:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-10-01 03:21:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 03:21:19,288 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:19,378 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 03:21:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 10 states and 19 transitions. [2018-10-01 03:21:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 19 transitions. [2018-10-01 03:21:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 03:21:19,777 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:19,866 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 03:21:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 11 states and 22 transitions. [2018-10-01 03:21:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2018-10-01 03:21:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 03:21:20,531 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:20,605 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 03:21:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 12 states and 25 transitions. [2018-10-01 03:21:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 25 transitions. [2018-10-01 03:21:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 03:21:20,903 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:21,004 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 03:21:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 13 states and 28 transitions. [2018-10-01 03:21:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2018-10-01 03:21:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 03:21:21,539 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:21,644 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 03:21:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 14 states and 31 transitions. [2018-10-01 03:21:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 31 transitions. [2018-10-01 03:21:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 03:21:22,219 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:22,324 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 03:21:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 15 states and 34 transitions. [2018-10-01 03:21:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 34 transitions. [2018-10-01 03:21:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 03:21:22,709 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:22,791 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 03:21:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 16 states and 37 transitions. [2018-10-01 03:21:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 37 transitions. [2018-10-01 03:21:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 03:21:23,674 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:23,778 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 03:21:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 17 states and 39 transitions. [2018-10-01 03:21:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 39 transitions. [2018-10-01 03:21:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 03:21:24,150 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:24,224 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 03:21:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 29 states and 62 transitions. [2018-10-01 03:21:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 62 transitions. [2018-10-01 03:21:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 03:21:26,765 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:26,815 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 03:21:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 28 states and 41 transitions. [2018-10-01 03:21:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2018-10-01 03:21:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-01 03:21:30,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:30,143 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 03:21:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 40 states and 64 transitions. [2018-10-01 03:21:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2018-10-01 03:21:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 03:21:33,377 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:33,426 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 03:21:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 40 states and 54 transitions. [2018-10-01 03:21:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-10-01 03:21:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 03:21:36,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:37,036 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 03:21:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 52 states and 77 transitions. [2018-10-01 03:21:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2018-10-01 03:21:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 03:21:41,200 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:41,309 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 03:21:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 52 states and 67 transitions. [2018-10-01 03:21:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2018-10-01 03:21:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 03:21:46,652 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:47,290 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 03:21:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 64 states and 90 transitions. [2018-10-01 03:21:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2018-10-01 03:21:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 03:21:52,223 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:52,340 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 03:21:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:21:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 64 states and 80 transitions. [2018-10-01 03:21:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2018-10-01 03:21:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 03:21:58,227 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:21:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:21:58,643 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 03:22:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 76 states and 103 transitions. [2018-10-01 03:22:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2018-10-01 03:22:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 03:22:05,016 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:05,077 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 03:22:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 76 states and 93 transitions. [2018-10-01 03:22:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-10-01 03:22:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 03:22:12,268 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:12,472 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 03:22:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 88 states and 116 transitions. [2018-10-01 03:22:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2018-10-01 03:22:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 03:22:20,261 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:20,371 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 03:22:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 88 states and 106 transitions. [2018-10-01 03:22:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-10-01 03:22:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-01 03:22:29,218 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:29,459 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 03:22:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 100 states and 129 transitions. [2018-10-01 03:22:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2018-10-01 03:22:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-01 03:22:39,426 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:39,544 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 03:22:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:22:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 100 states and 119 transitions. [2018-10-01 03:22:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-10-01 03:22:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-01 03:22:50,117 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:22:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:22:50,564 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 03:23:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:23:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 112 states and 142 transitions. [2018-10-01 03:23:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2018-10-01 03:23:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-01 03:23:03,168 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:23:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:23:03,286 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 03:23:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:23:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 112 states and 132 transitions. [2018-10-01 03:23:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-10-01 03:23:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-01 03:23:16,367 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:23:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:23:16,706 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 03:23:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:23:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 124 states and 144 transitions. [2018-10-01 03:23:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2018-10-01 03:23:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-01 03:23:30,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:23:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:23:30,891 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 03:23:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:23:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 124 states and 134 transitions. [2018-10-01 03:23:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-01 03:23:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-01 03:23:46,356 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 03:23:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 03:24:47,181 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 03:28:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 03:28:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 122 states and 132 transitions. [2018-10-01 03:28:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-01 03:28:53,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 03:28:53,904 WARN L420 CodeCheckObserver]: This Program is SAFE, Check terminated with 0 iterations. [2018-10-01 03:28:53,915 INFO L776 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-01 03:28:54,017 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 03:28:54 ImpRootNode [2018-10-01 03:28:54,017 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 03:28:54,019 INFO L168 Benchmark]: Toolchain (without parser) took 457488.29 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 292.5 MB). Peak memory consumption was 438.8 MB. Max. memory is 7.1 GB. [2018-10-01 03:28:54,021 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.31 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-10-01 03:28:54,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 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-10-01 03:28:54,022 INFO L168 Benchmark]: Boogie Preprocessor took 26.70 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-10-01 03:28:54,023 INFO L168 Benchmark]: RCFGBuilder took 323.39 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 03:28:54,024 INFO L168 Benchmark]: CodeCheck took 457087.33 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 271.4 MB). Peak memory consumption was 417.7 MB. Max. memory is 7.1 GB. [2018-10-01 03:28:54,028 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, 456.9s 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, 46.9s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 64.6s 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_~m~5 < main_~j~5 + 4 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~5) && 47 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 9) || (((((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 && 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) && main_~n~5 < main_~i~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_~n~5 < main_~i~5 + 10) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 35 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((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_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 7) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 6 <= main_~m~5) && 84 <= main_~k~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 4) && 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_~j~5 + 2 <= main_~m~5 && main_~i~5 + 8 <= main_~n~5) && 28 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((((74 <= main_~k~5 && main_~n~5 < main_~i~5 + 6) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 3) && 58 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 94 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((main_~m~5 < main_~j~5 + 4 && main_~i~5 + 7 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 37 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 7 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 93 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && 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)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 76 <= main_~k~5) && main_~m~5 < main_~j~5 + 5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 4) && 27 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 3 <= 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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 39 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || (((((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)) || ((((((((((main_~n~5 < main_~i~5 + 6 && 90 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 97 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && 100 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~n~5 < main_~i~5 + 8 && 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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 64 <= main_~k~5) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 60 <= main_~k~5) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && main_~m~5 < main_~j~5 + 1) && 10 <= main_~m~5)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && 98 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 68 <= main_~k~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 + 5) && 36 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 30 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~j~5 + 9 <= main_~m~5 && main_~n~5 < main_~i~5 + 8) && 41 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((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)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && 78 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 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 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && 70 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((((46 <= main_~k~5 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((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)) || (((((((((main_~n~5 < main_~i~5 + 6 && 56 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 9 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 51 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && 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)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 1 <= main_~m~5) && 69 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 7 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 63 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~n~5 < main_~i~5 + 8 && main_~m~5 < main_~j~5 + 9) && 42 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && 89 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 2) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 1 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 65 <= main_~k~5) && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 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_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || (((((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_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((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)) || ((((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_~n~5 < main_~i~5 + 6 && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~m~5 < main_~j~5 + 10) && 91 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 80 <= main_~k~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && 54 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && 70 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((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 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && 34 <= main_~k~5) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 6 <= 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_~i~5 + 7 <= main_~n~5 && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 30 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~n~5 < main_~i~5 + 8 && main_~m~5 < main_~j~5 + 7) && main_~i~5 + 6 <= main_~n~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 44 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~n~5 < main_~i~5 + 6 && 50 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 57 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((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_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 8) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 83 <= main_~k~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && 71 <= main_~k~5) && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((main_~i~5 + 8 <= main_~n~5 && 25 <= 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 + 9)) || ((((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 10) && 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 + 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_~n~5 < main_~i~5 + 6 && 90 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((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_~i~5 + 7 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && 31 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9) && 75 <= main_~k~5)) || ((((((((main_~j~5 + 1 <= main_~m~5 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && 49 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && 85 <= main_~k~5) && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~j~5 + 5 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((40 <= main_~k~5 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 5) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~j~5 + 4 <= main_~m~5) && 86 <= main_~k~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 60 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((main_~i~5 + 8 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 21 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((45 <= main_~k~5 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~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 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && main_~n~5 < main_~i~5 + 8) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && 77 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((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)) || ((((((main_~i~5 + 8 <= main_~n~5 && main_~m~5 < main_~j~5 + 5) && 26 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 1 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && 79 <= main_~k~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 1 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 2) && 99 <= main_~k~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && 61 <= main_~k~5) && main_~j~5 + 9 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~m~5 < main_~j~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && 72 <= main_~k~5) && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 8 <= 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_~j~5 + 7 <= main_~m~5) && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && 33 <= main_~k~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~m~5 < main_~j~5 + 4) && main_~n~5 < main_~i~5 + 8) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 67 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 2 <= main_~m~5) && main_~n~5 < main_~i~5 + 8) && 88 <= main_~k~5) && main_~m~5 < main_~j~5 + 3) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 6) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~j~5 + 5 <= main_~m~5) && 95 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && 82 <= main_~k~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~j~5 + 1 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 59 <= main_~k~5) && main_~m~5 < main_~j~5 + 2) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || (((((((((main_~n~5 < main_~i~5 + 6 && main_~i~5 + 5 <= main_~n~5) && main_~n~5 < main_~i~5 + 8) && 55 <= 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 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((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) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || ((((((((((((main_~n~5 < main_~i~5 + 6 && 81 <= main_~k~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) && main_~n~5 < main_~i~5 + 7) && main_~i~5 + 2 <= main_~n~5) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || ((((((((main_~j~5 + 2 <= main_~m~5 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 3) && main_~i~5 + 6 <= main_~n~5) && 48 <= main_~k~5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && 62 <= 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)) || (((((((50 <= main_~k~5 && main_~n~5 < main_~i~5 + 8) && main_~i~5 + 6 <= main_~n~5) && main_~m~5 < main_~j~5 + 1) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 9)) || ((((((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && main_~m~5 < main_~j~5 + 7) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && 73 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && main_~n~5 < main_~i~5 + 5) && main_~m~5 < main_~j~5 + 8) && main_~n~5 < main_~i~5 + 10) && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && main_~n~5 < main_~i~5 + 7) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9)) || (((((((((((main_~n~5 < main_~i~5 + 6 && main_~n~5 < main_~i~5 + 8) && main_~m~5 < main_~j~5 + 9) && main_~n~5 < main_~i~5 + 5) && main_~n~5 < main_~i~5 + 2) && main_~n~5 < main_~i~5 + 10) && main_~n~5 < main_~i~5 + 3) && 92 <= main_~k~5) && main_~n~5 < main_~i~5 + 7) && main_~j~5 + 8 <= main_~m~5) && main_~n~5 < main_~i~5 + 4) && main_~n~5 < main_~i~5 + 9) - 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.31 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.97 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 26.70 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 323.39 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 457087.33 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 271.4 MB). Peak memory consumption was 417.7 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_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-01_03-28-54-046.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-01_03-28-54-046.csv Received shutdown request...