./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label52.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b --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 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:56:23,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:56:23,628 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:56:23,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:56:23,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:56:23,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:56:23,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:56:23,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:56:23,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:56:23,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:56:23,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:56:23,655 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:56:23,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:56:23,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:56:23,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:56:23,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:56:23,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:56:23,656 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:56:23,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:56:23,656 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_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b 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 -> 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 [2024-12-06 04:56:23,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:56:23,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:56:23,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:56:23,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:56:23,895 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:56:23,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2024-12-06 04:56:26,579 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/data/d7128f895/18143aae829646e298f7cc0cab9fbf9e/FLAG5546e3ff1 [2024-12-06 04:56:26,832 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:56:26,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2024-12-06 04:56:26,844 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/data/d7128f895/18143aae829646e298f7cc0cab9fbf9e/FLAG5546e3ff1 [2024-12-06 04:56:26,858 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/data/d7128f895/18143aae829646e298f7cc0cab9fbf9e [2024-12-06 04:56:26,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:56:26,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:56:26,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:56:26,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:56:26,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:56:26,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:56:26" (1/1) ... [2024-12-06 04:56:26,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f945a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:26, skipping insertion in model container [2024-12-06 04:56:26,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:56:26" (1/1) ... [2024-12-06 04:56:26,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:56:27,136 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_a6ee78ec-ec26-4b8e-8abc-0852c836e436/sv-benchmarks/c/eca-rers2012/Problem02_label52.c[17244,17257] [2024-12-06 04:56:27,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:56:27,172 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:56:27,231 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_a6ee78ec-ec26-4b8e-8abc-0852c836e436/sv-benchmarks/c/eca-rers2012/Problem02_label52.c[17244,17257] [2024-12-06 04:56:27,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:56:27,257 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:56:27,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27 WrapperNode [2024-12-06 04:56:27,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:56:27,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:56:27,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:56:27,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:56:27,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,310 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 04:56:27,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:56:27,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:56:27,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:56:27,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:56:27,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:56:27,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:56:27,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:56:27,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:56:27,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:56:27" (1/1) ... [2024-12-06 04:56:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:56:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:56:27,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:56:27,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:56:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:56:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:56:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:56:27,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:56:27,471 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:56:27,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:56:28,272 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 04:56:28,272 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:56:28,473 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:56:28,473 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 04:56:28,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:56:28 BoogieIcfgContainer [2024-12-06 04:56:28,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:56:28,474 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:56:28,475 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:56:28,481 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:56:28,481 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:56:28" (1/1) ... [2024-12-06 04:56:28,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:56:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 04:56:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 04:56:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 04:56:28,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 04:56:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 04:56:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 04:56:29,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 04:56:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 04:56:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 04:56:30,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 04:56:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 04:56:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 04:56:30,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 04:56:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 04:56:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 04:56:30,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:30,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:56:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 04:56:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 04:56:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 04:56:31,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 04:56:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 04:56:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 04:56:31,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 04:56:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 04:56:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 04:56:31,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 04:56:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 04:56:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 04:56:31,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-12-06 04:56:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-12-06 04:56:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 04:56:32,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 410 states and 522 transitions. [2024-12-06 04:56:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 522 transitions. [2024-12-06 04:56:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 04:56:33,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 04:56:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 428 states and 542 transitions. [2024-12-06 04:56:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 542 transitions. [2024-12-06 04:56:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 04:56:33,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 442 states and 557 transitions. [2024-12-06 04:56:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2024-12-06 04:56:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 04:56:33,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 449 states and 564 transitions. [2024-12-06 04:56:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 564 transitions. [2024-12-06 04:56:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 04:56:33,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 04:56:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 455 states and 572 transitions. [2024-12-06 04:56:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 572 transitions. [2024-12-06 04:56:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 04:56:33,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 462 states and 579 transitions. [2024-12-06 04:56:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 579 transitions. [2024-12-06 04:56:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 04:56:34,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 484 states and 607 transitions. [2024-12-06 04:56:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 607 transitions. [2024-12-06 04:56:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 04:56:34,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 04:56:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 499 states and 625 transitions. [2024-12-06 04:56:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2024-12-06 04:56:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 04:56:34,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:56:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 530 states and 658 transitions. [2024-12-06 04:56:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 658 transitions. [2024-12-06 04:56:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 04:56:35,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:35,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 554 states and 686 transitions. [2024-12-06 04:56:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 686 transitions. [2024-12-06 04:56:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 04:56:35,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:56:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 557 states and 689 transitions. [2024-12-06 04:56:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 689 transitions. [2024-12-06 04:56:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 04:56:35,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 636 states and 775 transitions. [2024-12-06 04:56:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 775 transitions. [2024-12-06 04:56:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 04:56:36,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 653 states and 791 transitions. [2024-12-06 04:56:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 791 transitions. [2024-12-06 04:56:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 04:56:36,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 684 states and 828 transitions. [2024-12-06 04:56:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 828 transitions. [2024-12-06 04:56:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 04:56:37,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 04:56:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 708 states and 854 transitions. [2024-12-06 04:56:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 854 transitions. [2024-12-06 04:56:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 04:56:37,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 04:56:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 717 states and 864 transitions. [2024-12-06 04:56:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 864 transitions. [2024-12-06 04:56:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 04:56:37,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:56:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 736 states and 883 transitions. [2024-12-06 04:56:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 883 transitions. [2024-12-06 04:56:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 04:56:37,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 04:56:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 739 states and 886 transitions. [2024-12-06 04:56:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2024-12-06 04:56:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:56:37,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 04:56:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 765 states and 917 transitions. [2024-12-06 04:56:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 917 transitions. [2024-12-06 04:56:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 04:56:38,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 796 states and 952 transitions. [2024-12-06 04:56:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 952 transitions. [2024-12-06 04:56:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 04:56:38,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 803 states and 959 transitions. [2024-12-06 04:56:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 959 transitions. [2024-12-06 04:56:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 04:56:38,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 846 states and 1007 transitions. [2024-12-06 04:56:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1007 transitions. [2024-12-06 04:56:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 04:56:39,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 04:56:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 849 states and 1010 transitions. [2024-12-06 04:56:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1010 transitions. [2024-12-06 04:56:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 04:56:39,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 04:56:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 858 states and 1019 transitions. [2024-12-06 04:56:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1019 transitions. [2024-12-06 04:56:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 04:56:39,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 04:56:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 895 states and 1058 transitions. [2024-12-06 04:56:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1058 transitions. [2024-12-06 04:56:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 04:56:40,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 04:56:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 897 states and 1061 transitions. [2024-12-06 04:56:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1061 transitions. [2024-12-06 04:56:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 04:56:40,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 04:56:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 898 states and 1061 transitions. [2024-12-06 04:56:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1061 transitions. [2024-12-06 04:56:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 04:56:40,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 924 states and 1090 transitions. [2024-12-06 04:56:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1090 transitions. [2024-12-06 04:56:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:56:41,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 04:56:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 925 states and 1090 transitions. [2024-12-06 04:56:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1090 transitions. [2024-12-06 04:56:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 04:56:41,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 04:56:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 994 states and 1167 transitions. [2024-12-06 04:56:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1167 transitions. [2024-12-06 04:56:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 04:56:43,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 04:56:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1007 states and 1180 transitions. [2024-12-06 04:56:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1180 transitions. [2024-12-06 04:56:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 04:56:43,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-12-06 04:56:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1092 states and 1272 transitions. [2024-12-06 04:56:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1272 transitions. [2024-12-06 04:56:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:56:44,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 04:56:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1163 states and 1350 transitions. [2024-12-06 04:56:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1350 transitions. [2024-12-06 04:56:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-12-06 04:56:46,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 04:56:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1196 states and 1387 transitions. [2024-12-06 04:56:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1387 transitions. [2024-12-06 04:56:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 04:56:46,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 04:56:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1197 states and 1387 transitions. [2024-12-06 04:56:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1387 transitions. [2024-12-06 04:56:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 04:56:46,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 212 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 04:56:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1279 states and 1480 transitions. [2024-12-06 04:56:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1480 transitions. [2024-12-06 04:56:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 04:56:48,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1330 states and 1533 transitions. [2024-12-06 04:56:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1533 transitions. [2024-12-06 04:56:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 04:56:49,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1343 states and 1545 transitions. [2024-12-06 04:56:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1545 transitions. [2024-12-06 04:56:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 04:56:49,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 04:56:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1386 states and 1592 transitions. [2024-12-06 04:56:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1592 transitions. [2024-12-06 04:56:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 04:56:50,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 04:56:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1464 states and 1673 transitions. [2024-12-06 04:56:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1673 transitions. [2024-12-06 04:56:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 04:56:51,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 04:56:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1467 states and 1675 transitions. [2024-12-06 04:56:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1675 transitions. [2024-12-06 04:56:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 04:56:52,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 167 proven. 4 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-06 04:56:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1486 states and 1697 transitions. [2024-12-06 04:56:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1697 transitions. [2024-12-06 04:56:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 04:56:53,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 04:56:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1494 states and 1705 transitions. [2024-12-06 04:56:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1705 transitions. [2024-12-06 04:56:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-12-06 04:56:53,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:56:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1620 states and 1840 transitions. [2024-12-06 04:56:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1840 transitions. [2024-12-06 04:56:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-12-06 04:56:56,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:56:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1640 states and 1859 transitions. [2024-12-06 04:56:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1859 transitions. [2024-12-06 04:56:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-12-06 04:56:56,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-06 04:56:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1651 states and 1873 transitions. [2024-12-06 04:56:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1873 transitions. [2024-12-06 04:56:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 04:56:57,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 04:56:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1676 states and 1903 transitions. [2024-12-06 04:56:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1903 transitions. [2024-12-06 04:56:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 04:56:57,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 04:56:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1693 states and 1920 transitions. [2024-12-06 04:56:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1920 transitions. [2024-12-06 04:56:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 04:56:58,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:57:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 1766 states and 2000 transitions. [2024-12-06 04:57:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2000 transitions. [2024-12-06 04:57:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 04:57:00,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:57:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1799 states and 2033 transitions. [2024-12-06 04:57:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2033 transitions. [2024-12-06 04:57:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 04:57:01,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 04:57:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1802 states and 2035 transitions. [2024-12-06 04:57:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2035 transitions. [2024-12-06 04:57:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 04:57:02,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 04:57:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1805 states and 2037 transitions. [2024-12-06 04:57:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2037 transitions. [2024-12-06 04:57:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 04:57:02,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 04:57:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1808 states and 2039 transitions. [2024-12-06 04:57:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2039 transitions. [2024-12-06 04:57:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-12-06 04:57:03,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-12-06 04:57:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1810 states and 2043 transitions. [2024-12-06 04:57:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2043 transitions. [2024-12-06 04:57:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 04:57:03,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-12-06 04:57:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1817 states and 2050 transitions. [2024-12-06 04:57:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2050 transitions. [2024-12-06 04:57:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 04:57:04,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-12-06 04:57:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1480 states and 1676 transitions. [2024-12-06 04:57:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1676 transitions. [2024-12-06 04:57:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 04:57:04,528 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 66 iterations. [2024-12-06 04:57:04,537 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 04:57:10,623 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,623 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,623 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,624 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,625 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,626 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,627 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,628 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,629 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,630 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L490-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,631 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L493-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-12-06 04:57:10,632 INFO L75 FloydHoareUtils]: For program point L494(line 494) no Hoare annotation was computed. [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,632 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 04:57:10,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:57:10 ImpRootNode [2024-12-06 04:57:10,642 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:57:10,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:57:10,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:57:10,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:57:10,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:56:28" (3/4) ... [2024-12-06 04:57:10,644 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 04:57:10,655 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-12-06 04:57:10,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 04:57:10,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 04:57:10,657 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 04:57:10,749 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:57:10,749 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:57:10,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:57:10,750 INFO L158 Benchmark]: Toolchain (without parser) took 43889.03ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 92.2MB in the beginning and 653.6MB in the end (delta: -561.5MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2024-12-06 04:57:10,750 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:57:10,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.13ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 66.4MB in the end (delta: 25.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:57:10,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 61.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:57:10,751 INFO L158 Benchmark]: Boogie Preprocessor took 51.16ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 57.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:57:10,751 INFO L158 Benchmark]: RCFGBuilder took 1111.04ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 31.5MB in the end (delta: 25.7MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2024-12-06 04:57:10,752 INFO L158 Benchmark]: CodeCheck took 42167.17ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 31.5MB in the beginning and 666.2MB in the end (delta: -634.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:57:10,752 INFO L158 Benchmark]: Witness Printer took 107.47ms. Allocated memory is still 755.0MB. Free memory was 666.2MB in the beginning and 653.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:57:10,753 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.0s, OverallIterations: 66, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118904 SdHoareTripleChecker+Valid, 262.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118327 mSDsluCounter, 16581 SdHoareTripleChecker+Invalid, 218.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13952 mSDsCounter, 35898 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263421 IncrementalHoareTripleChecker+Invalid, 299319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35898 mSolverCounterUnsat, 2629 mSDtfsCounter, 263421 mSolverCounterSat, 2.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79021 GetRequests, 77043 SyntacticMatches, 1540 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106243 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 11894 NumberOfCodeBlocks, 11894 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 11829 ConstructedInterpolants, 0 QuantifiedInterpolants, 37557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 54 PerfectInterpolantSequences, 11306/11662 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, ConComCheckerStatistics: No data available - PositiveResult [Line: 494]: 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: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * 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 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.13ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 66.4MB in the end (delta: 25.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 61.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.16ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 57.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1111.04ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 31.5MB in the end (delta: 25.7MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * CodeCheck took 42167.17ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 31.5MB in the beginning and 666.2MB in the end (delta: -634.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 107.47ms. Allocated memory is still 755.0MB. Free memory was 666.2MB in the beginning and 653.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 04:57:10,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ee78ec-ec26-4b8e-8abc-0852c836e436/bin/ukojak-verify-CZk0znPC7b/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