./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-new/nested-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-new/nested-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:34:37,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:34:37,381 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:34:37,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:34:37,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:34:37,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:34:37,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:34:37,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:34:37,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:34:37,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:34:37,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:34:37,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:34:37,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:34:37,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:34:37,425 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:34:37,425 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:34:37,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:34:37,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:34:37,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:34:37,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:34:37,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:34:37,427 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:34:37,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:34:37,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a [2024-11-13 21:34:37,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:34:37,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:34:37,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:34:37,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:34:37,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:34:37,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/loop-new/nested-1.i Unable to find full path for "g++" [2024-11-13 21:34:39,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:34:39,901 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:34:39,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/sv-benchmarks/c/loop-new/nested-1.i [2024-11-13 21:34:39,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/data/d659d5fa4/e8cddb43d5f34c0399f0d75a6baca8a2/FLAG71acf399f [2024-11-13 21:34:39,930 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/data/d659d5fa4/e8cddb43d5f34c0399f0d75a6baca8a2 [2024-11-13 21:34:39,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:34:39,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:34:39,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:34:39,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:34:39,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:34:39,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:34:39" (1/1) ... [2024-11-13 21:34:39,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5313d1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:39, skipping insertion in model container [2024-11-13 21:34:39,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:34:39" (1/1) ... [2024-11-13 21:34:39,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:34:40,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2024-11-13 21:34:40,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:34:40,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:34:40,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2024-11-13 21:34:40,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:34:40,148 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:34:40,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40 WrapperNode [2024-11-13 21:34:40,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:34:40,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:34:40,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:34:40,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:34:40,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,178 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-13 21:34:40,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:34:40,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:34:40,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:34:40,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:34:40,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:34:40,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:34:40,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:34:40,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:34:40,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:34:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:34:40,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:34:40,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:34:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:34:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:34:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:34:40,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:34:40,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:34:40,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:34:40,439 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-13 21:34:40,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:34:40,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:34:40,470 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 21:34:40,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:34:40 BoogieIcfgContainer [2024-11-13 21:34:40,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:34:40,471 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:34:40,471 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:34:40,482 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:34:40,482 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:34:40" (1/1) ... [2024-11-13 21:34:40,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:34:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 11 states and 15 transitions. [2024-11-13 21:34:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2024-11-13 21:34:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:34:40,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2024-11-13 21:34:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2024-11-13 21:34:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:34:40,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 14 states and 21 transitions. [2024-11-13 21:34:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2024-11-13 21:34:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:34:41,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 15 states and 25 transitions. [2024-11-13 21:34:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 25 transitions. [2024-11-13 21:34:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:34:41,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 16 states and 28 transitions. [2024-11-13 21:34:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2024-11-13 21:34:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:34:41,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 17 states and 31 transitions. [2024-11-13 21:34:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2024-11-13 21:34:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:34:42,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 18 states and 34 transitions. [2024-11-13 21:34:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2024-11-13 21:34:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:34:42,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 19 states and 37 transitions. [2024-11-13 21:34:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 37 transitions. [2024-11-13 21:34:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:34:42,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 20 states and 40 transitions. [2024-11-13 21:34:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 40 transitions. [2024-11-13 21:34:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:34:42,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 21 states and 43 transitions. [2024-11-13 21:34:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 43 transitions. [2024-11-13 21:34:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:34:43,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 22 states and 46 transitions. [2024-11-13 21:34:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2024-11-13 21:34:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:34:43,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 23 states and 48 transitions. [2024-11-13 21:34:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2024-11-13 21:34:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:34:43,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-13 21:34:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 35 states and 73 transitions. [2024-11-13 21:34:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2024-11-13 21:34:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:34:45,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-13 21:34:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 46 states and 85 transitions. [2024-11-13 21:34:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-11-13 21:34:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:34:47,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 21:34:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 58 states and 109 transitions. [2024-11-13 21:34:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2024-11-13 21:34:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 21:34:51,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-13 21:34:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 46 states and 66 transitions. [2024-11-13 21:34:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-13 21:34:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:34:53,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 21:34:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 58 states and 90 transitions. [2024-11-13 21:34:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 90 transitions. [2024-11-13 21:34:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 21:34:57,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2024-11-13 21:35:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2024-11-13 21:35:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-11-13 21:35:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 21:35:01,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 21:35:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 70 states and 104 transitions. [2024-11-13 21:35:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-11-13 21:35:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 21:35:05,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2024-11-13 21:35:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 70 states and 94 transitions. [2024-11-13 21:35:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2024-11-13 21:35:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 21:35:09,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-13 21:35:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 82 states and 118 transitions. [2024-11-13 21:35:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-13 21:35:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 21:35:15,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2024-11-13 21:35:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 82 states and 108 transitions. [2024-11-13 21:35:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2024-11-13 21:35:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:35:20,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-13 21:35:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 94 states and 132 transitions. [2024-11-13 21:35:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-11-13 21:35:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:35:26,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 2166 trivial. 0 not checked. [2024-11-13 21:35:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 94 states and 122 transitions. [2024-11-13 21:35:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2024-11-13 21:35:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 21:35:33,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-13 21:35:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 106 states and 146 transitions. [2024-11-13 21:35:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-13 21:35:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:35:40,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2954 trivial. 0 not checked. [2024-11-13 21:35:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 106 states and 136 transitions. [2024-11-13 21:35:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2024-11-13 21:35:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:35:47,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2024-11-13 21:35:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 118 states and 160 transitions. [2024-11-13 21:35:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2024-11-13 21:35:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 21:35:55,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2024-11-13 21:36:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 118 states and 150 transitions. [2024-11-13 21:36:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2024-11-13 21:36:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 21:36:03,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-13 21:36:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 130 states and 163 transitions. [2024-11-13 21:36:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2024-11-13 21:36:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 21:36:13,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2024-11-13 21:36:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 130 states and 153 transitions. [2024-11-13 21:36:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-11-13 21:36:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:36:22,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 5922 proven. 119 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:41:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 252 states and 319 transitions. [2024-11-13 21:41:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 319 transitions. [2024-11-13 21:41:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 21:41:18,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6271 backedges. 3913 proven. 2306 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 21:42:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 267 states and 345 transitions. [2024-11-13 21:42:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 345 transitions. [2024-11-13 21:42:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 21:42:22,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 8570 proven. 143 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:43:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 130 states and 153 transitions. [2024-11-13 21:43:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-11-13 21:43:00,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:43:00,148 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 33 iterations. [2024-11-13 21:43:00,158 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:43:15,567 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:43:15,567 INFO L77 FloydHoareUtils]: At program point L29(line 29) the Hoare annotation is: (= |ULTIMATE.start_main_~k~0#1| 0) [2024-11-13 21:43:15,567 INFO L77 FloydHoareUtils]: At program point L31-2(lines 31 35) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse3 (<= 10 |ULTIMATE.start_main_~n~0#1|)) (.cse0 (<= 10 |ULTIMATE.start_main_~m~0#1|))) (or (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= 80 |ULTIMATE.start_main_~k~0#1|) .cse0) (and (<= 90 |ULTIMATE.start_main_~k~0#1|) (<= .cse1 |ULTIMATE.start_main_~n~0#1|) .cse0) (and (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= 70 |ULTIMATE.start_main_~k~0#1|) .cse0) (and .cse0 (<= (+ 5 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= 50 |ULTIMATE.start_main_~k~0#1|)) (and (<= 20 |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 8) |ULTIMATE.start_main_~n~0#1|) .cse0) (and (< |ULTIMATE.start_main_~n~0#1| .cse1) (<= 100 |ULTIMATE.start_main_~k~0#1|)) (and (<= (+ 6 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse0 (<= 40 |ULTIMATE.start_main_~k~0#1|)) (and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= 30 |ULTIMATE.start_main_~k~0#1|) .cse0) (and (<= 60 |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|) .cse0) (and .cse2 .cse3 (= |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= 10 |ULTIMATE.start_main_~k~0#1|) (not (and .cse2 .cse3)) .cse0))) [2024-11-13 21:43:15,567 INFO L75 FloydHoareUtils]: For program point L19(line 19) no Hoare annotation was computed. [2024-11-13 21:43:15,568 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:43:15,568 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 24 38) the Hoare annotation is: true [2024-11-13 21:43:15,569 INFO L77 FloydHoareUtils]: At program point L30(line 30) the Hoare annotation is: (and (<= 10 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0)) [2024-11-13 21:43:15,571 INFO L77 FloydHoareUtils]: At program point L32-2(lines 32 34) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (<= 10 |ULTIMATE.start_main_~n~0#1|)) (.cse33 (+ 5 |ULTIMATE.start_main_~i~0#1|)) (.cse50 (+ 7 |ULTIMATE.start_main_~j~0#1|)) (.cse59 (+ 2 |ULTIMATE.start_main_~j~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~i~0#1| 4)) (.cse61 (+ 3 |ULTIMATE.start_main_~i~0#1|)) (.cse54 (+ |ULTIMATE.start_main_~j~0#1| 8)) (.cse62 (+ 9 |ULTIMATE.start_main_~j~0#1|)) (.cse56 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse51 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse58 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (.cse52 (+ 5 |ULTIMATE.start_main_~j~0#1|)) (.cse55 (+ |ULTIMATE.start_main_~i~0#1| 8)) (.cse57 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse49 (+ 9 |ULTIMATE.start_main_~i~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~j~0#1| 4)) (.cse60 (+ |ULTIMATE.start_main_~j~0#1| 1)) (.cse64 (+ 3 |ULTIMATE.start_main_~j~0#1|))) (let ((.cse0 (< |ULTIMATE.start_main_~m~0#1| .cse64)) (.cse41 (<= 10 |ULTIMATE.start_main_~k~0#1|)) (.cse39 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse44 (< |ULTIMATE.start_main_~m~0#1| .cse60)) (.cse27 (<= 70 |ULTIMATE.start_main_~k~0#1|)) (.cse18 (<= 40 |ULTIMATE.start_main_~k~0#1|)) (.cse40 (<= 50 |ULTIMATE.start_main_~k~0#1|)) (.cse25 (<= .cse64 |ULTIMATE.start_main_~m~0#1|)) (.cse26 (< |ULTIMATE.start_main_~m~0#1| .cse63)) (.cse5 (< |ULTIMATE.start_main_~n~0#1| .cse49)) (.cse12 (< |ULTIMATE.start_main_~n~0#1| .cse57)) (.cse45 (<= 60 |ULTIMATE.start_main_~k~0#1|)) (.cse48 (<= 20 |ULTIMATE.start_main_~k~0#1|)) (.cse8 (<= .cse63 |ULTIMATE.start_main_~m~0#1|)) (.cse7 (<= .cse55 |ULTIMATE.start_main_~n~0#1|)) (.cse20 (< |ULTIMATE.start_main_~m~0#1| .cse52)) (.cse38 (< |ULTIMATE.start_main_~m~0#1| .cse58)) (.cse9 (<= .cse51 |ULTIMATE.start_main_~n~0#1|)) (.cse10 (< |ULTIMATE.start_main_~n~0#1| .cse56)) (.cse35 (<= .cse62 |ULTIMATE.start_main_~m~0#1|)) (.cse28 (<= .cse54 |ULTIMATE.start_main_~m~0#1|)) (.cse29 (< |ULTIMATE.start_main_~m~0#1| .cse62)) (.cse19 (<= .cse61 |ULTIMATE.start_main_~n~0#1|)) (.cse46 (< |ULTIMATE.start_main_~n~0#1| .cse53)) (.cse3 (<= .cse59 |ULTIMATE.start_main_~m~0#1|)) (.cse16 (< |ULTIMATE.start_main_~n~0#1| .cse61)) (.cse15 (<= 90 |ULTIMATE.start_main_~k~0#1|)) (.cse36 (<= .cse60 |ULTIMATE.start_main_~m~0#1|)) (.cse37 (< |ULTIMATE.start_main_~m~0#1| .cse59)) (.cse31 (<= .cse58 |ULTIMATE.start_main_~m~0#1|)) (.cse32 (< |ULTIMATE.start_main_~m~0#1| .cse50)) (.cse6 (<= 30 |ULTIMATE.start_main_~k~0#1|)) (.cse14 (<= .cse57 |ULTIMATE.start_main_~n~0#1|)) (.cse47 (<= 80 |ULTIMATE.start_main_~k~0#1|)) (.cse17 (= |ULTIMATE.start_main_~j~0#1| 0)) (.cse21 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse22 (< |ULTIMATE.start_main_~n~0#1| .cse55)) (.cse30 (< |ULTIMATE.start_main_~m~0#1| .cse54)) (.cse34 (<= .cse53 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (<= .cse52 |ULTIMATE.start_main_~m~0#1|)) (.cse42 (<= .cse33 |ULTIMATE.start_main_~n~0#1|)) (.cse43 (< |ULTIMATE.start_main_~n~0#1| .cse51)) (.cse11 (<= .cse50 |ULTIMATE.start_main_~m~0#1|)) (.cse23 (<= .cse49 |ULTIMATE.start_main_~n~0#1|)) (.cse24 (not (and .cse1 .cse2))) (.cse4 (<= 10 |ULTIMATE.start_main_~m~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 .cse6 .cse7 .cse4) (and .cse8 (<= 46 |ULTIMATE.start_main_~k~0#1|) .cse9 .cse4 .cse10) (and (<= 93 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse12) (and (<= 95 |ULTIMATE.start_main_~k~0#1|) .cse12 .cse13) (and .cse14 .cse15 .cse4 .cse16) (and (<= 45 |ULTIMATE.start_main_~k~0#1|) .cse9 .cse13 .cse4 .cse10) (and .cse9 .cse4 .cse17 .cse18) (and (<= 76 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse19 .cse4 .cse20) (and .cse21 .cse22 .cse3 .cse4 (<= 38 |ULTIMATE.start_main_~k~0#1|)) (and .cse23 (<= 18 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse24 .cse4) (and .cse25 .cse1 .cse2 (<= 7 |ULTIMATE.start_main_~k~0#1|) .cse26 .cse4) (and .cse19 .cse27 .cse4 .cse17) (and .cse23 .cse28 (<= 12 |ULTIMATE.start_main_~k~0#1|) .cse29 .cse4) (and .cse1 .cse30 .cse2 .cse11 .cse4 (<= 3 |ULTIMATE.start_main_~k~0#1|)) (and .cse25 .cse12 (<= 97 |ULTIMATE.start_main_~k~0#1|)) (and .cse1 .cse2 (= |ULTIMATE.start_main_~k~0#1| 0) .cse4 .cse17) (and .cse31 (<= 24 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse4 .cse32) (and (< |ULTIMATE.start_main_~n~0#1| .cse33) (<= 61 |ULTIMATE.start_main_~k~0#1|) .cse34 .cse35 .cse4) (and .cse31 .cse21 (<= 34 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse32) (and .cse8 .cse23 .cse4 .cse20 (<= 16 |ULTIMATE.start_main_~k~0#1|)) (and .cse25 .cse19 .cse26 .cse4 (<= 77 |ULTIMATE.start_main_~k~0#1|)) (and .cse25 .cse9 .cse4 (<= 47 |ULTIMATE.start_main_~k~0#1|) .cse10) (and .cse8 .cse1 .cse2 (<= 6 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse20) (and .cse36 (<= 69 |ULTIMATE.start_main_~k~0#1|) .cse37 .cse34 .cse4) (and (<= 25 |ULTIMATE.start_main_~k~0#1|) .cse13 .cse7 .cse4 .cse38) (and .cse1 .cse2 (<= 4 .cse39) .cse4 .cse17) (and .cse9 .cse4 .cse10 .cse40) (and .cse23 .cse41 .cse4 .cse17) (and .cse5 .cse7 .cse35 .cse4 (<= 21 |ULTIMATE.start_main_~k~0#1|)) (and (<= 65 |ULTIMATE.start_main_~k~0#1|) .cse13 .cse34 .cse4 .cse38) (and .cse0 .cse34 .cse3 .cse4 (<= 68 |ULTIMATE.start_main_~k~0#1|)) (and .cse8 .cse12 (<= 96 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 .cse7 (<= 28 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4) (and .cse19 .cse28 (<= 72 |ULTIMATE.start_main_~k~0#1|) .cse29 .cse4) (and .cse28 .cse4 .cse42 (<= 52 |ULTIMATE.start_main_~k~0#1|) .cse43) (and .cse36 .cse37 .cse7 .cse4 (<= 29 |ULTIMATE.start_main_~k~0#1|)) (and .cse8 .cse34 .cse4 .cse20 (<= 66 |ULTIMATE.start_main_~k~0#1|)) (and .cse1 .cse44 .cse2 .cse41 .cse4) (and .cse45 .cse4 .cse42 .cse43) (and .cse36 (<= 99 |ULTIMATE.start_main_~k~0#1|) .cse12) (and (<= 98 |ULTIMATE.start_main_~k~0#1|) .cse12 .cse3) (and .cse8 (<= 56 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse42 .cse43) (and .cse36 .cse9 .cse4 (<= 49 |ULTIMATE.start_main_~k~0#1|) .cse10) (and .cse36 .cse19 .cse46 .cse4 (<= 79 |ULTIMATE.start_main_~k~0#1|)) (and (<= 51 |ULTIMATE.start_main_~k~0#1|) .cse35 .cse4 .cse42 .cse43) (and (<= 58 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 .cse42 .cse43) (and (<= 22 |ULTIMATE.start_main_~k~0#1|) .cse28 .cse7 .cse29 .cse4) (and .cse19 .cse47 .cse46 .cse4) (and .cse1 .cse2 .cse13 (<= 5 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse38) (and .cse1 .cse36 .cse2 (<= 9 |ULTIMATE.start_main_~k~0#1|) .cse37 .cse4) (and .cse36 .cse23 .cse24 .cse4 (<= 19 |ULTIMATE.start_main_~k~0#1|)) (and .cse9 (<= 48 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 .cse10) (and .cse1 .cse2 (not .cse17) .cse35 .cse4 (<= 1 |ULTIMATE.start_main_~k~0#1|) (<= 2 .cse39)) (and .cse12 (<= 91 |ULTIMATE.start_main_~k~0#1|) .cse35) (and .cse48 .cse7 .cse4 .cse17) (and .cse44 .cse27 .cse34 .cse4) (and .cse14 .cse13 .cse4 (<= 85 |ULTIMATE.start_main_~k~0#1|) .cse16) (and .cse25 (<= 17 |ULTIMATE.start_main_~k~0#1|) .cse23 .cse24 .cse4) (and (<= 42 |ULTIMATE.start_main_~k~0#1|) .cse28 .cse9 .cse4 .cse10) (and .cse31 .cse23 .cse4 .cse32 (<= 14 |ULTIMATE.start_main_~k~0#1|)) (and .cse25 (<= 67 |ULTIMATE.start_main_~k~0#1|) .cse34 .cse26 .cse4) (and .cse31 .cse14 (<= 84 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse16) (and .cse25 .cse21 (<= 37 |ULTIMATE.start_main_~k~0#1|) .cse26 .cse4) (and .cse25 .cse14 (<= 87 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse16) (and .cse21 .cse22 .cse4 .cse18) (and (<= 31 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse22 .cse35 .cse4) (and .cse8 (<= 86 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse4 .cse16) (and .cse8 .cse21 (<= 36 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse20) (and .cse25 (<= 57 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse42 .cse43) (and .cse19 .cse11 .cse46 .cse4 (<= 73 |ULTIMATE.start_main_~k~0#1|)) (and .cse4 .cse42 .cse17 .cse40) (and .cse25 .cse7 .cse26 .cse4 (<= 27 |ULTIMATE.start_main_~k~0#1|)) (and .cse19 .cse13 (<= 75 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse38) (and .cse12 (<= 100 |ULTIMATE.start_main_~k~0#1|)) (and .cse11 .cse5 .cse7 .cse4 (<= 23 |ULTIMATE.start_main_~k~0#1|)) (and (<= 71 |ULTIMATE.start_main_~k~0#1|) .cse19 .cse46 .cse35 .cse4) (and .cse11 .cse4 .cse42 (<= 53 |ULTIMATE.start_main_~k~0#1|) .cse43) (and .cse14 (<= 82 |ULTIMATE.start_main_~k~0#1|) .cse28 .cse4 .cse16) (and .cse31 .cse12 (<= 94 |ULTIMATE.start_main_~k~0#1|)) (and .cse28 .cse12 (<= 92 |ULTIMATE.start_main_~k~0#1|)) (and .cse45 .cse34 .cse4 .cse17) (and .cse48 .cse23 .cse24 .cse4) (and .cse8 (<= 26 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse4 .cse20) (and .cse21 (<= 35 |ULTIMATE.start_main_~k~0#1|) .cse13 .cse4 .cse38) (and .cse28 .cse34 .cse29 .cse4 (<= 62 |ULTIMATE.start_main_~k~0#1|)) (and .cse21 .cse28 .cse29 .cse4 (<= 32 |ULTIMATE.start_main_~k~0#1|)) (and (<= 83 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse11 .cse4 .cse16) (and .cse36 (<= 59 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse42 .cse43) (and .cse36 .cse14 .cse4 (<= 89 |ULTIMATE.start_main_~k~0#1|) .cse16) (and .cse23 .cse35 .cse24 .cse4 (<= 11 |ULTIMATE.start_main_~k~0#1|)) (and .cse31 (<= 54 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse42 .cse43) (and .cse31 .cse19 .cse4 .cse32 (<= 74 |ULTIMATE.start_main_~k~0#1|)) (and (<= 15 |ULTIMATE.start_main_~k~0#1|) .cse23 .cse13 .cse4 .cse38) (and .cse31 .cse9 (<= 44 |ULTIMATE.start_main_~k~0#1|) .cse4 .cse10) (and (<= 43 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse9 .cse4 .cse10) (and (<= 41 |ULTIMATE.start_main_~k~0#1|) .cse9 .cse35 .cse4 .cse10) (and .cse14 (<= 81 |ULTIMATE.start_main_~k~0#1|) .cse35 .cse4 .cse16) (and .cse1 (<= 2 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse28 .cse29 .cse4) (and (<= 78 |ULTIMATE.start_main_~k~0#1|) .cse19 .cse46 .cse3 .cse4) (and .cse31 (<= 64 |ULTIMATE.start_main_~k~0#1|) .cse34 .cse4 .cse32) (and (<= 88 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse3 .cse4 .cse16) (and .cse15 .cse4 .cse17) (and .cse36 .cse21 .cse37 .cse4 (<= 39 |ULTIMATE.start_main_~k~0#1|)) (and .cse31 .cse1 (<= 4 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse4 .cse32) (and .cse21 .cse6 .cse4 .cse17) (and .cse14 .cse47 .cse4 .cse17) (and .cse21 .cse11 .cse22 .cse4 (<= 33 |ULTIMATE.start_main_~k~0#1|)) (and .cse30 (<= 63 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse34 .cse4) (and (<= 55 |ULTIMATE.start_main_~k~0#1|) .cse13 .cse4 .cse42 .cse43) (and .cse11 .cse23 (<= 13 |ULTIMATE.start_main_~k~0#1|) .cse24 .cse4)))) [2024-11-13 21:43:15,571 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2024-11-13 21:43:15,571 INFO L77 FloydHoareUtils]: At program point L18(lines 18 20) the Hoare annotation is: (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) [2024-11-13 21:43:15,571 INFO L77 FloydHoareUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2024-11-13 21:43:15,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:43:15 ImpRootNode [2024-11-13 21:43:15,683 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:43:15,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:43:15,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:43:15,684 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:43:15,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:34:40" (3/4) ... [2024-11-13 21:43:15,687 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:43:15,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 21:43:15,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 21:43:15,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 21:43:15,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:43:15,819 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:43:15,823 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:43:15,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:43:15,824 INFO L158 Benchmark]: Toolchain (without parser) took 515890.44ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 116.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 569.7MB. Max. memory is 16.1GB. [2024-11-13 21:43:15,824 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:43:15,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.34ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 105.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:43:15,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.29ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:43:15,825 INFO L158 Benchmark]: Boogie Preprocessor took 16.81ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.7MB in the end (delta: 524.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:43:15,827 INFO L158 Benchmark]: RCFGBuilder took 273.84ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 93.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:43:15,828 INFO L158 Benchmark]: CodeCheck took 515211.65ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 93.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 21:43:15,828 INFO L158 Benchmark]: Witness Printer took 140.14ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:43:15,831 INFO L338 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, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 499.6s, OverallIterations: 33, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4374 SdHoareTripleChecker+Valid, 37.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3902 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 32.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23869 IncrementalHoareTripleChecker+Invalid, 33560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9691 mSolverCounterUnsat, 300 mSDtfsCounter, 23869 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15178 GetRequests, 12264 SyntacticMatches, 1212 SemanticMatches, 1702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393909 ImplicationChecksByTransitivity, 484.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 105.1s InterpolantComputationTime, 1741 NumberOfCodeBlocks, 1741 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 6434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 38671/56089 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((m < ((long long) 3 + j)) && (i == 0)) && (10 <= n)) && (((long long) 2 + j) <= m)) && (10 <= m)) && (8 <= k)) || ((((n < ((long long) 9 + i)) && (30 <= k)) && (((long long) i + 8) <= n)) && (10 <= m))) || (((((((long long) j + 4) <= m) && (46 <= k)) && (((long long) 6 + i) <= n)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((93 <= k) && (((long long) 7 + j) <= m)) && (n < ((long long) 2 + i)))) || (((95 <= k) && (n < ((long long) 2 + i))) && (((long long) 5 + j) <= m))) || ((((((long long) 2 + i) <= n) && (90 <= k)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((((45 <= k) && (((long long) 6 + i) <= n)) && (((long long) 5 + j) <= m)) && (10 <= m)) && (n < ((long long) 7 + i)))) || ((((((long long) 6 + i) <= n) && (10 <= m)) && (j == 0)) && (40 <= k))) || (((((76 <= k) && (((long long) j + 4) <= m)) && (((long long) 3 + i) <= n)) && (10 <= m)) && (m < ((long long) 5 + j)))) || (((((((long long) 7 + i) <= n) && (n < ((long long) i + 8))) && (((long long) 2 + j) <= m)) && (10 <= m)) && (38 <= k))) || (((((((long long) 9 + i) <= n) && (18 <= k)) && (((long long) 2 + j) <= m)) && !((i == 0) && (10 <= n))) && (10 <= m))) || ((((((((long long) 3 + j) <= m) && (i == 0)) && (10 <= n)) && (7 <= k)) && (m < ((long long) j + 4))) && (10 <= m))) || ((((((long long) 3 + i) <= n) && (70 <= k)) && (10 <= m)) && (j == 0))) || (((((((long long) 9 + i) <= n) && (((long long) j + 8) <= m)) && (12 <= k)) && (m < ((long long) 9 + j))) && (10 <= m))) || ((((((i == 0) && (m < ((long long) j + 8))) && (10 <= n)) && (((long long) 7 + j) <= m)) && (10 <= m)) && (3 <= k))) || (((((long long) 3 + j) <= m) && (n < ((long long) 2 + i))) && (97 <= k))) || (((((i == 0) && (10 <= n)) && (k == 0)) && (10 <= m)) && (j == 0))) || (((((((long long) 6 + j) <= m) && (24 <= k)) && (((long long) i + 8) <= n)) && (10 <= m)) && (m < ((long long) 7 + j)))) || (((((n < ((long long) 5 + i)) && (61 <= k)) && (((long long) i + 4) <= n)) && (((long long) 9 + j) <= m)) && (10 <= m))) || (((((((long long) 6 + j) <= m) && (((long long) 7 + i) <= n)) && (34 <= k)) && (10 <= m)) && (m < ((long long) 7 + j)))) || (((((((long long) j + 4) <= m) && (((long long) 9 + i) <= n)) && (10 <= m)) && (m < ((long long) 5 + j))) && (16 <= k))) || (((((((long long) 3 + j) <= m) && (((long long) 3 + i) <= n)) && (m < ((long long) j + 4))) && (10 <= m)) && (77 <= k))) || (((((((long long) 3 + j) <= m) && (((long long) 6 + i) <= n)) && (10 <= m)) && (47 <= k)) && (n < ((long long) 7 + i)))) || ((((((((long long) j + 4) <= m) && (i == 0)) && (10 <= n)) && (6 <= k)) && (10 <= m)) && (m < ((long long) 5 + j)))) || (((((((long long) j + 1) <= m) && (69 <= k)) && (m < ((long long) 2 + j))) && (((long long) i + 4) <= n)) && (10 <= m))) || (((((25 <= k) && (((long long) 5 + j) <= m)) && (((long long) i + 8) <= n)) && (10 <= m)) && (m < ((long long) 6 + j)))) || (((((i == 0) && (10 <= n)) && (4 <= ((long long) j + k))) && (10 <= m)) && (j == 0))) || ((((((long long) 6 + i) <= n) && (10 <= m)) && (n < ((long long) 7 + i))) && (50 <= k))) || ((((((long long) 9 + i) <= n) && (10 <= k)) && (10 <= m)) && (j == 0))) || (((((n < ((long long) 9 + i)) && (((long long) i + 8) <= n)) && (((long long) 9 + j) <= m)) && (10 <= m)) && (21 <= k))) || (((((65 <= k) && (((long long) 5 + j) <= m)) && (((long long) i + 4) <= n)) && (10 <= m)) && (m < ((long long) 6 + j)))) || (((((m < ((long long) 3 + j)) && (((long long) i + 4) <= n)) && (((long long) 2 + j) <= m)) && (10 <= m)) && (68 <= k))) || (((((long long) j + 4) <= m) && (n < ((long long) 2 + i))) && (96 <= k))) || (((((n < ((long long) 9 + i)) && (((long long) i + 8) <= n)) && (28 <= k)) && (((long long) 2 + j) <= m)) && (10 <= m))) || (((((((long long) 3 + i) <= n) && (((long long) j + 8) <= m)) && (72 <= k)) && (m < ((long long) 9 + j))) && (10 <= m))) || (((((((long long) j + 8) <= m) && (10 <= m)) && (((long long) 5 + i) <= n)) && (52 <= k)) && (n < ((long long) 6 + i)))) || (((((((long long) j + 1) <= m) && (m < ((long long) 2 + j))) && (((long long) i + 8) <= n)) && (10 <= m)) && (29 <= k))) || (((((((long long) j + 4) <= m) && (((long long) i + 4) <= n)) && (10 <= m)) && (m < ((long long) 5 + j))) && (66 <= k))) || (((((i == 0) && (m < ((long long) j + 1))) && (10 <= n)) && (10 <= k)) && (10 <= m))) || ((((60 <= k) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((long long) j + 1) <= m) && (99 <= k)) && (n < ((long long) 2 + i)))) || (((98 <= k) && (n < ((long long) 2 + i))) && (((long long) 2 + j) <= m))) || (((((((long long) j + 4) <= m) && (56 <= k)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((((long long) j + 1) <= m) && (((long long) 6 + i) <= n)) && (10 <= m)) && (49 <= k)) && (n < ((long long) 7 + i)))) || (((((((long long) j + 1) <= m) && (((long long) 3 + i) <= n)) && (n < ((long long) i + 4))) && (10 <= m)) && (79 <= k))) || (((((51 <= k) && (((long long) 9 + j) <= m)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((58 <= k) && (((long long) 2 + j) <= m)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((22 <= k) && (((long long) j + 8) <= m)) && (((long long) i + 8) <= n)) && (m < ((long long) 9 + j))) && (10 <= m))) || ((((((long long) 3 + i) <= n) && (80 <= k)) && (n < ((long long) i + 4))) && (10 <= m))) || ((((((i == 0) && (10 <= n)) && (((long long) 5 + j) <= m)) && (5 <= k)) && (10 <= m)) && (m < ((long long) 6 + j)))) || ((((((i == 0) && (((long long) j + 1) <= m)) && (10 <= n)) && (9 <= k)) && (m < ((long long) 2 + j))) && (10 <= m))) || (((((((long long) j + 1) <= m) && (((long long) 9 + i) <= n)) && !((i == 0) && (10 <= n))) && (10 <= m)) && (19 <= k))) || (((((((long long) 6 + i) <= n) && (48 <= k)) && (((long long) 2 + j) <= m)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((((((i == 0) && (10 <= n)) && (j != 0)) && (((long long) 9 + j) <= m)) && (10 <= m)) && (1 <= k)) && (2 <= ((long long) j + k)))) || (((n < ((long long) 2 + i)) && (91 <= k)) && (((long long) 9 + j) <= m))) || ((((20 <= k) && (((long long) i + 8) <= n)) && (10 <= m)) && (j == 0))) || ((((m < ((long long) j + 1)) && (70 <= k)) && (((long long) i + 4) <= n)) && (10 <= m))) || (((((((long long) 2 + i) <= n) && (((long long) 5 + j) <= m)) && (10 <= m)) && (85 <= k)) && (n < ((long long) 3 + i)))) || (((((((long long) 3 + j) <= m) && (17 <= k)) && (((long long) 9 + i) <= n)) && !((i == 0) && (10 <= n))) && (10 <= m))) || (((((42 <= k) && (((long long) j + 8) <= m)) && (((long long) 6 + i) <= n)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((((((long long) 6 + j) <= m) && (((long long) 9 + i) <= n)) && (10 <= m)) && (m < ((long long) 7 + j))) && (14 <= k))) || (((((((long long) 3 + j) <= m) && (67 <= k)) && (((long long) i + 4) <= n)) && (m < ((long long) j + 4))) && (10 <= m))) || (((((((long long) 6 + j) <= m) && (((long long) 2 + i) <= n)) && (84 <= k)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((((((long long) 3 + j) <= m) && (((long long) 7 + i) <= n)) && (37 <= k)) && (m < ((long long) j + 4))) && (10 <= m))) || (((((((long long) 3 + j) <= m) && (((long long) 2 + i) <= n)) && (87 <= k)) && (10 <= m)) && (n < ((long long) 3 + i)))) || ((((((long long) 7 + i) <= n) && (n < ((long long) i + 8))) && (10 <= m)) && (40 <= k))) || (((((31 <= k) && (((long long) 7 + i) <= n)) && (n < ((long long) i + 8))) && (((long long) 9 + j) <= m)) && (10 <= m))) || (((((((long long) j + 4) <= m) && (86 <= k)) && (((long long) 2 + i) <= n)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((((((long long) j + 4) <= m) && (((long long) 7 + i) <= n)) && (36 <= k)) && (10 <= m)) && (m < ((long long) 5 + j)))) || (((((((long long) 3 + j) <= m) && (57 <= k)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((((long long) 3 + i) <= n) && (((long long) 7 + j) <= m)) && (n < ((long long) i + 4))) && (10 <= m)) && (73 <= k))) || ((((10 <= m) && (((long long) 5 + i) <= n)) && (j == 0)) && (50 <= k))) || (((((((long long) 3 + j) <= m) && (((long long) i + 8) <= n)) && (m < ((long long) j + 4))) && (10 <= m)) && (27 <= k))) || (((((((long long) 3 + i) <= n) && (((long long) 5 + j) <= m)) && (75 <= k)) && (10 <= m)) && (m < ((long long) 6 + j)))) || ((n < ((long long) 2 + i)) && (100 <= k))) || (((((((long long) 7 + j) <= m) && (n < ((long long) 9 + i))) && (((long long) i + 8) <= n)) && (10 <= m)) && (23 <= k))) || (((((71 <= k) && (((long long) 3 + i) <= n)) && (n < ((long long) i + 4))) && (((long long) 9 + j) <= m)) && (10 <= m))) || (((((((long long) 7 + j) <= m) && (10 <= m)) && (((long long) 5 + i) <= n)) && (53 <= k)) && (n < ((long long) 6 + i)))) || (((((((long long) 2 + i) <= n) && (82 <= k)) && (((long long) j + 8) <= m)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((((long long) 6 + j) <= m) && (n < ((long long) 2 + i))) && (94 <= k))) || (((((long long) j + 8) <= m) && (n < ((long long) 2 + i))) && (92 <= k))) || ((((60 <= k) && (((long long) i + 4) <= n)) && (10 <= m)) && (j == 0))) || ((((20 <= k) && (((long long) 9 + i) <= n)) && !((i == 0) && (10 <= n))) && (10 <= m))) || (((((((long long) j + 4) <= m) && (26 <= k)) && (((long long) i + 8) <= n)) && (10 <= m)) && (m < ((long long) 5 + j)))) || (((((((long long) 7 + i) <= n) && (35 <= k)) && (((long long) 5 + j) <= m)) && (10 <= m)) && (m < ((long long) 6 + j)))) || (((((((long long) j + 8) <= m) && (((long long) i + 4) <= n)) && (m < ((long long) 9 + j))) && (10 <= m)) && (62 <= k))) || (((((((long long) 7 + i) <= n) && (((long long) j + 8) <= m)) && (m < ((long long) 9 + j))) && (10 <= m)) && (32 <= k))) || (((((83 <= k) && (((long long) 2 + i) <= n)) && (((long long) 7 + j) <= m)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((((((long long) j + 1) <= m) && (59 <= k)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((((long long) j + 1) <= m) && (((long long) 2 + i) <= n)) && (10 <= m)) && (89 <= k)) && (n < ((long long) 3 + i)))) || (((((((long long) 9 + i) <= n) && (((long long) 9 + j) <= m)) && !((i == 0) && (10 <= n))) && (10 <= m)) && (11 <= k))) || (((((((long long) 6 + j) <= m) && (54 <= k)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((((long long) 6 + j) <= m) && (((long long) 3 + i) <= n)) && (10 <= m)) && (m < ((long long) 7 + j))) && (74 <= k))) || (((((15 <= k) && (((long long) 9 + i) <= n)) && (((long long) 5 + j) <= m)) && (10 <= m)) && (m < ((long long) 6 + j)))) || (((((((long long) 6 + j) <= m) && (((long long) 6 + i) <= n)) && (44 <= k)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((((43 <= k) && (((long long) 7 + j) <= m)) && (((long long) 6 + i) <= n)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((((41 <= k) && (((long long) 6 + i) <= n)) && (((long long) 9 + j) <= m)) && (10 <= m)) && (n < ((long long) 7 + i)))) || (((((((long long) 2 + i) <= n) && (81 <= k)) && (((long long) 9 + j) <= m)) && (10 <= m)) && (n < ((long long) 3 + i)))) || ((((((i == 0) && (2 <= k)) && (10 <= n)) && (((long long) j + 8) <= m)) && (m < ((long long) 9 + j))) && (10 <= m))) || (((((78 <= k) && (((long long) 3 + i) <= n)) && (n < ((long long) i + 4))) && (((long long) 2 + j) <= m)) && (10 <= m))) || (((((((long long) 6 + j) <= m) && (64 <= k)) && (((long long) i + 4) <= n)) && (10 <= m)) && (m < ((long long) 7 + j)))) || (((((88 <= k) && (((long long) 2 + i) <= n)) && (((long long) 2 + j) <= m)) && (10 <= m)) && (n < ((long long) 3 + i)))) || (((90 <= k) && (10 <= m)) && (j == 0))) || (((((((long long) j + 1) <= m) && (((long long) 7 + i) <= n)) && (m < ((long long) 2 + j))) && (10 <= m)) && (39 <= k))) || ((((((((long long) 6 + j) <= m) && (i == 0)) && (4 <= k)) && (10 <= n)) && (10 <= m)) && (m < ((long long) 7 + j)))) || ((((((long long) 7 + i) <= n) && (30 <= k)) && (10 <= m)) && (j == 0))) || ((((((long long) 2 + i) <= n) && (80 <= k)) && (10 <= m)) && (j == 0))) || (((((((long long) 7 + i) <= n) && (((long long) 7 + j) <= m)) && (n < ((long long) i + 8))) && (10 <= m)) && (33 <= k))) || (((((m < ((long long) j + 8)) && (63 <= k)) && (((long long) 7 + j) <= m)) && (((long long) i + 4) <= n)) && (10 <= m))) || (((((55 <= k) && (((long long) 5 + j) <= m)) && (10 <= m)) && (((long long) 5 + i) <= n)) && (n < ((long long) 6 + i)))) || (((((((long long) 7 + j) <= m) && (((long long) 9 + i) <= n)) && (13 <= k)) && !((i == 0) && (10 <= n))) && (10 <= m))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((long long) 2 + i) <= n) && (80 <= k)) && (10 <= m)) || (((90 <= k) && (((long long) i + 1) <= n)) && (10 <= m))) || (((((long long) 3 + i) <= n) && (70 <= k)) && (10 <= m))) || (((10 <= m) && (((long long) 5 + i) <= n)) && (50 <= k))) || (((20 <= k) && (((long long) i + 8) <= n)) && (10 <= m))) || ((n < ((long long) i + 1)) && (100 <= k))) || (((((long long) 6 + i) <= n) && (10 <= m)) && (40 <= k))) || (((((long long) 7 + i) <= n) && (30 <= k)) && (10 <= m))) || (((60 <= k) && (((long long) i + 4) <= n)) && (10 <= m))) || ((((i == 0) && (10 <= n)) && (k == 0)) && (10 <= m))) || ((((((long long) 9 + i) <= n) && (10 <= k)) && !((i == 0) && (10 <= n))) && (10 <= m))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.34ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 105.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.29ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.81ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.7MB in the end (delta: 524.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 273.84ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 93.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 515211.65ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 93.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 140.14ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:43:15,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1774f1dc-119f-4af0-adf5-362964613f04/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE