./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/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 d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:03:03,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:03:03,290 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:03:03,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:03:03,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:03:03,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:03:03,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:03:03,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:03:03,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:03:03,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:03:03,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:03:03,314 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:03:03,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:03:03,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:03:03,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:03:03,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:03:03,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:03:03,315 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:03:03,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:03:03,315 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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/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 -> d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 [2024-12-06 05:03:03,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:03:03,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:03:03,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:03:03,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:03:03,532 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:03:03,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-12-06 05:03:06,258 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/data/b465f8855/5ddfe8bb56974195a5e44a4fcd1a4874/FLAG9ead37363 [2024-12-06 05:03:06,532 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:03:06,532 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-12-06 05:03:06,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/data/b465f8855/5ddfe8bb56974195a5e44a4fcd1a4874/FLAG9ead37363 [2024-12-06 05:03:06,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/data/b465f8855/5ddfe8bb56974195a5e44a4fcd1a4874 [2024-12-06 05:03:06,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:03:06,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:03:06,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:03:06,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:03:06,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:03:06,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:06,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2b4b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06, skipping insertion in model container [2024-12-06 05:03:06,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:06,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:03:06,819 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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-12-06 05:03:06,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:03:06,848 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:03:06,917 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_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-12-06 05:03:06,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:03:06,937 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:03:06,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06 WrapperNode [2024-12-06 05:03:06,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:03:06,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:03:06,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:03:06,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:03:06,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:06,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:06,994 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 05:03:06,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:03:06,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:03:06,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:03:06,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:03:07,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:03:07,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:03:07,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:03:07,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:03:07,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:03:06" (1/1) ... [2024-12-06 05:03:07,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:03:07,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:03:07,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:03:07,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:03:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:03:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:03:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:03:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:03:07,150 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:03:07,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:03:07,994 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 05:03:07,994 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:03:08,265 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:03:08,265 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:03:08,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:03:08 BoogieIcfgContainer [2024-12-06 05:03:08,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:03:08,266 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:03:08,267 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:03:08,276 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:03:08,276 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:03:08" (1/1) ... [2024-12-06 05:03:08,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:03:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 05:03:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 05:03:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 05:03:08,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:08,781 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 05:03:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 05:03:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 05:03:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 05:03:09,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:09,614 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 05:03:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 05:03:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 05:03:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:03:10,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:10,465 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 05:03:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 05:03:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 05:03:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 05:03:10,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:10,649 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 05:03:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 05:03:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 05:03:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:03:10,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:10,778 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 05:03:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 05:03:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 05:03:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 05:03:10,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:11,002 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 05:03:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 05:03:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 05:03:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:03:11,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:11,110 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 05:03:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 05:03:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 05:03:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 05:03:11,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:11,250 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 05:03:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 05:03:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 05:03:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 05:03:11,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:11,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:11,595 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 05:03:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-12-06 05:03:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-12-06 05:03:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:03:12,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:12,560 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 05:03:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 410 states and 522 transitions. [2024-12-06 05:03:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 522 transitions. [2024-12-06 05:03:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:03:12,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:12,875 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 05:03:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 428 states and 542 transitions. [2024-12-06 05:03:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 542 transitions. [2024-12-06 05:03:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:03:13,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,094 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 05:03:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 442 states and 557 transitions. [2024-12-06 05:03:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2024-12-06 05:03:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:03:13,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,291 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 05:03:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 449 states and 564 transitions. [2024-12-06 05:03:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 564 transitions. [2024-12-06 05:03:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:03:13,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,406 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 05:03:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 455 states and 572 transitions. [2024-12-06 05:03:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 572 transitions. [2024-12-06 05:03:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 05:03:13,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,606 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 05:03:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 462 states and 579 transitions. [2024-12-06 05:03:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 579 transitions. [2024-12-06 05:03:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:03:13,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:03:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 476 states and 597 transitions. [2024-12-06 05:03:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 597 transitions. [2024-12-06 05:03:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 05:03:13,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:13,967 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 05:03:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 491 states and 615 transitions. [2024-12-06 05:03:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 615 transitions. [2024-12-06 05:03:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:03:14,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:14,354 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 05:03:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 522 states and 648 transitions. [2024-12-06 05:03:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 648 transitions. [2024-12-06 05:03:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 05:03:14,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:14,665 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 05:03:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 546 states and 678 transitions. [2024-12-06 05:03:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 678 transitions. [2024-12-06 05:03:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:03:14,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:15,042 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 05:03:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 549 states and 681 transitions. [2024-12-06 05:03:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 681 transitions. [2024-12-06 05:03:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:03:15,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:15,312 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 05:03:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 680 states and 818 transitions. [2024-12-06 05:03:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 818 transitions. [2024-12-06 05:03:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:03:16,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:16,642 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 05:03:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 697 states and 834 transitions. [2024-12-06 05:03:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 834 transitions. [2024-12-06 05:03:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:03:16,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:16,875 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 05:03:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 714 states and 854 transitions. [2024-12-06 05:03:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 854 transitions. [2024-12-06 05:03:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 05:03:17,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:03:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 741 states and 883 transitions. [2024-12-06 05:03:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 883 transitions. [2024-12-06 05:03:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 05:03:17,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:17,532 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 05:03:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 792 states and 941 transitions. [2024-12-06 05:03:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 941 transitions. [2024-12-06 05:03:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 05:03:17,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:03:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 819 states and 970 transitions. [2024-12-06 05:03:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 970 transitions. [2024-12-06 05:03:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 05:03:18,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:18,238 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 05:03:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 845 states and 1001 transitions. [2024-12-06 05:03:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1001 transitions. [2024-12-06 05:03:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:03:18,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:18,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:18,744 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 05:03:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 876 states and 1036 transitions. [2024-12-06 05:03:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1036 transitions. [2024-12-06 05:03:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:03:19,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:19,172 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 05:03:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 893 states and 1053 transitions. [2024-12-06 05:03:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1053 transitions. [2024-12-06 05:03:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:03:19,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:19,438 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 05:03:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 900 states and 1060 transitions. [2024-12-06 05:03:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1060 transitions. [2024-12-06 05:03:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 05:03:19,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:19,637 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 05:03:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 943 states and 1108 transitions. [2024-12-06 05:03:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1108 transitions. [2024-12-06 05:03:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:03:20,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:20,344 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 05:03:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 946 states and 1113 transitions. [2024-12-06 05:03:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1113 transitions. [2024-12-06 05:03:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 05:03:20,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:20,507 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 05:03:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 983 states and 1152 transitions. [2024-12-06 05:03:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1152 transitions. [2024-12-06 05:03:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-06 05:03:20,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:03:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1019 states and 1191 transitions. [2024-12-06 05:03:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1191 transitions. [2024-12-06 05:03:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:03:21,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:03:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1098 states and 1278 transitions. [2024-12-06 05:03:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1278 transitions. [2024-12-06 05:03:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:03:22,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:22,984 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 05:03:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1100 states and 1279 transitions. [2024-12-06 05:03:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1279 transitions. [2024-12-06 05:03:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 05:03:23,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:23,266 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 05:03:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1101 states and 1279 transitions. [2024-12-06 05:03:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1279 transitions. [2024-12-06 05:03:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:03:23,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:23,472 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 05:03:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1127 states and 1308 transitions. [2024-12-06 05:03:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1308 transitions. [2024-12-06 05:03:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 05:03:24,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:03:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1155 states and 1337 transitions. [2024-12-06 05:03:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1337 transitions. [2024-12-06 05:03:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 05:03:24,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1183 states and 1367 transitions. [2024-12-06 05:03:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1367 transitions. [2024-12-06 05:03:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-06 05:03:24,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 05:03:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1196 states and 1379 transitions. [2024-12-06 05:03:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1379 transitions. [2024-12-06 05:03:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 05:03:24,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:03:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1221 states and 1405 transitions. [2024-12-06 05:03:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1405 transitions. [2024-12-06 05:03:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 05:03:25,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1288 states and 1482 transitions. [2024-12-06 05:03:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1482 transitions. [2024-12-06 05:03:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 05:03:26,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-12-06 05:03:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1318 states and 1512 transitions. [2024-12-06 05:03:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1512 transitions. [2024-12-06 05:03:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 05:03:26,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 05:03:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1319 states and 1512 transitions. [2024-12-06 05:03:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1512 transitions. [2024-12-06 05:03:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:03:27,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:27,120 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 05:03:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1320 states and 1512 transitions. [2024-12-06 05:03:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1512 transitions. [2024-12-06 05:03:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 05:03:27,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1325 states and 1518 transitions. [2024-12-06 05:03:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1518 transitions. [2024-12-06 05:03:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 05:03:27,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:27,663 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 05:03:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1327 states and 1520 transitions. [2024-12-06 05:03:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1520 transitions. [2024-12-06 05:03:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-12-06 05:03:27,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1397 states and 1601 transitions. [2024-12-06 05:03:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1601 transitions. [2024-12-06 05:03:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 05:03:28,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:28,980 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 05:03:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1482 states and 1693 transitions. [2024-12-06 05:03:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1693 transitions. [2024-12-06 05:03:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:03:30,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1556 states and 1771 transitions. [2024-12-06 05:03:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1771 transitions. [2024-12-06 05:03:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:03:31,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1563 states and 1777 transitions. [2024-12-06 05:03:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1777 transitions. [2024-12-06 05:03:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:03:31,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 05:03:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1596 states and 1815 transitions. [2024-12-06 05:03:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1815 transitions. [2024-12-06 05:03:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:03:32,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 05:03:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1626 states and 1847 transitions. [2024-12-06 05:03:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1847 transitions. [2024-12-06 05:03:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:03:32,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 05:03:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1633 states and 1853 transitions. [2024-12-06 05:03:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1853 transitions. [2024-12-06 05:03:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-06 05:03:33,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:03:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1669 states and 1896 transitions. [2024-12-06 05:03:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1896 transitions. [2024-12-06 05:03:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-06 05:03:33,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:03:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1683 states and 1910 transitions. [2024-12-06 05:03:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1910 transitions. [2024-12-06 05:03:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:03:34,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 05:03:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1696 states and 1928 transitions. [2024-12-06 05:03:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1928 transitions. [2024-12-06 05:03:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:03:34,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:03:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1720 states and 1955 transitions. [2024-12-06 05:03:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 1955 transitions. [2024-12-06 05:03:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:03:34,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:34,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:03:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1734 states and 1969 transitions. [2024-12-06 05:03:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 1969 transitions. [2024-12-06 05:03:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:03:35,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:35,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1749 states and 1987 transitions. [2024-12-06 05:03:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 1987 transitions. [2024-12-06 05:03:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:03:35,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1766 states and 2003 transitions. [2024-12-06 05:03:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2003 transitions. [2024-12-06 05:03:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:03:36,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:03:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1776 states and 2014 transitions. [2024-12-06 05:03:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2014 transitions. [2024-12-06 05:03:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 05:03:36,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 130 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:03:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1855 states and 2094 transitions. [2024-12-06 05:03:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2094 transitions. [2024-12-06 05:03:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-12-06 05:03:37,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 05:03:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1895 states and 2136 transitions. [2024-12-06 05:03:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2136 transitions. [2024-12-06 05:03:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:03:38,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 05:03:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1948 states and 2193 transitions. [2024-12-06 05:03:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2193 transitions. [2024-12-06 05:03:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-12-06 05:03:39,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-06 05:03:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 1986 states and 2231 transitions. [2024-12-06 05:03:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2231 transitions. [2024-12-06 05:03:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-12-06 05:03:39,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-12-06 05:03:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2144 states and 2398 transitions. [2024-12-06 05:03:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2398 transitions. [2024-12-06 05:03:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-12-06 05:03:41,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-06 05:03:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2146 states and 2399 transitions. [2024-12-06 05:03:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2399 transitions. [2024-12-06 05:03:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-12-06 05:03:42,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-12-06 05:03:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2188 states and 2441 transitions. [2024-12-06 05:03:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2441 transitions. [2024-12-06 05:03:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-12-06 05:03:42,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:03:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:03:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:03:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-12-06 05:03:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:03:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1950 states and 2191 transitions. [2024-12-06 05:03:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2191 transitions. [2024-12-06 05:03:42,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:03:42,917 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 72 iterations. [2024-12-06 05:03:42,923 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:03:51,466 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,467 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,468 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L517-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0)))) (or (<= 9 ~a28~0) (and (= ~a25~0 1) .cse0) (and .cse0 (<= ~a17~0 8) (not (= ~a11~0 1))) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,469 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L520-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0)))) (or (<= 9 ~a28~0) (and (= ~a25~0 1) .cse0) (and .cse0 (<= ~a17~0 8) (not (= ~a11~0 1))) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:03:51,470 INFO L75 FloydHoareUtils]: For program point L521(line 521) no Hoare annotation was computed. [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,470 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,471 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,472 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,473 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,474 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,475 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse2 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 .cse1) (and .cse0 (= ~a21~0 1) (= ~a19~0 1) .cse2) (and .cse1 (<= ~a17~0 8) .cse2) (<= ~a28~0 7))) [2024-12-06 05:03:51,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:03:51 ImpRootNode [2024-12-06 05:03:51,485 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:03:51,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:03:51,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:03:51,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:03:51,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:03:08" (3/4) ... [2024-12-06 05:03:51,488 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:03:51,498 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-06 05:03:51,499 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 05:03:51,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 05:03:51,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:03:51,615 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:03:51,616 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:03:51,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:03:51,617 INFO L158 Benchmark]: Toolchain (without parser) took 45055.40ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 115.3MB in the beginning and 548.8MB in the end (delta: -433.5MB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,617 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:03:51,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.77ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 89.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,618 INFO L158 Benchmark]: Boogie Preprocessor took 50.76ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 80.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:03:51,618 INFO L158 Benchmark]: RCFGBuilder took 1219.93ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 62.2MB in the end (delta: 17.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,618 INFO L158 Benchmark]: CodeCheck took 43218.86ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 62.2MB in the beginning and 561.1MB in the end (delta: -498.9MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,618 INFO L158 Benchmark]: Witness Printer took 130.05ms. Allocated memory is still 788.5MB. Free memory was 561.1MB in the beginning and 548.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:03:51,620 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: 34.6s, OverallIterations: 72, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148606 SdHoareTripleChecker+Valid, 319.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147975 mSDsluCounter, 18685 SdHoareTripleChecker+Invalid, 267.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15688 mSDsCounter, 41656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327947 IncrementalHoareTripleChecker+Invalid, 369603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41656 mSolverCounterUnsat, 2997 mSDtfsCounter, 327947 mSolverCounterSat, 2.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84201 GetRequests, 82057 SyntacticMatches, 1724 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104889 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 12166 NumberOfCodeBlocks, 12166 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 12095 ConstructedInterpolants, 0 QuantifiedInterpolants, 30935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 63 PerfectInterpolantSequences, 10366/10568 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: 521]: 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: (((((9 <= a28) || ((a25 == 1) && (7 != a17))) || ((((a25 == 1) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((9 <= a28) || ((a25 == 1) && (7 != a17))) || ((((a25 == 1) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.77ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 89.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.76ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 80.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1219.93ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 62.2MB in the end (delta: 17.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * CodeCheck took 43218.86ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 62.2MB in the beginning and 561.1MB in the end (delta: -498.9MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. * Witness Printer took 130.05ms. Allocated memory is still 788.5MB. Free memory was 561.1MB in the beginning and 548.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 05:03:51,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f56b93b-8e3c-4f1d-93f6-60a57e3773d5/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