./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk --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 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:31:11,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:31:11,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:31:11,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:31:11,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:31:11,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:31:11,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:31:11,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:31:11,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:31:11,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:31:11,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:31:11,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:31:11,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:31:11,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:31:11,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:31:11,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:31:11,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:31:11,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:31:11,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:31:11,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:31:11,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:31:11,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:31:11,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:31:11,668 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:31:11,668 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:31:11,668 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:31:11,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:31:11,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:31:11,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:31:11,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:31:11,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:31:11,670 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:31:11,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:31:11,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk 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 -> 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce [2024-11-08 23:31:11,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:31:11,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:31:11,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:31:11,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:31:11,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:31:11,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c Unable to find full path for "g++" [2024-11-08 23:31:14,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:31:14,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:31:14,330 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2024-11-08 23:31:14,343 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/data/394d8c607/646afd641e584b8688f4def4630b9606/FLAG55798ce97 [2024-11-08 23:31:14,360 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/data/394d8c607/646afd641e584b8688f4def4630b9606 [2024-11-08 23:31:14,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:31:14,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:31:14,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:31:14,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:31:14,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:31:14,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:14" (1/1) ... [2024-11-08 23:31:14,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1cd0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:14, skipping insertion in model container [2024-11-08 23:31:14,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:14" (1/1) ... [2024-11-08 23:31:14,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:31:14,817 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_24d4f344-a9ba-428c-ba7c-9429e7e265e0/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2024-11-08 23:31:14,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:31:14,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:31:15,010 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_24d4f344-a9ba-428c-ba7c-9429e7e265e0/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2024-11-08 23:31:15,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:31:15,067 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:31:15,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15 WrapperNode [2024-11-08 23:31:15,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:31:15,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:31:15,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:31:15,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:31:15,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,154 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-08 23:31:15,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:31:15,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:31:15,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:31:15,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:31:15,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:31:15,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:31:15,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:31:15,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:31:15,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:15" (1/1) ... [2024-11-08 23:31:15,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:31:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:31:15,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:31:15,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:31:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:31:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:31:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:31:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:31:15,430 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:31:15,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:31:16,642 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 23:31:16,642 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:31:17,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:31:17,001 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:31:17,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:17 BoogieIcfgContainer [2024-11-08 23:31:17,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:31:17,003 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:31:17,003 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:31:17,014 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:31:17,014 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:17" (1/1) ... [2024-11-08 23:31:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-08 23:31:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-08 23:31:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:31:17,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-08 23:31:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-08 23:31:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 23:31:18,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-08 23:31:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-08 23:31:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:31:19,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-08 23:31:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-08 23:31:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 23:31:19,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-08 23:31:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-08 23:31:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:31:20,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:31:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-08 23:31:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-08 23:31:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:31:20,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-08 23:31:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-08 23:31:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:31:20,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-08 23:31:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-08 23:31:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:31:20,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 311 states and 411 transitions. [2024-11-08 23:31:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 411 transitions. [2024-11-08 23:31:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:31:21,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 390 states and 502 transitions. [2024-11-08 23:31:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-08 23:31:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:31:23,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 414 states and 530 transitions. [2024-11-08 23:31:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 530 transitions. [2024-11-08 23:31:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:31:24,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 23:31:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-08 23:31:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-08 23:31:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:31:24,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-08 23:31:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-08 23:31:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:31:25,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 483 states and 613 transitions. [2024-11-08 23:31:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 613 transitions. [2024-11-08 23:31:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:31:26,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 489 states and 621 transitions. [2024-11-08 23:31:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 621 transitions. [2024-11-08 23:31:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:31:26,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 496 states and 629 transitions. [2024-11-08 23:31:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2024-11-08 23:31:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:31:26,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 512 states and 645 transitions. [2024-11-08 23:31:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 645 transitions. [2024-11-08 23:31:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:31:27,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 23:31:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 533 states and 671 transitions. [2024-11-08 23:31:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 671 transitions. [2024-11-08 23:31:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:31:27,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 555 states and 700 transitions. [2024-11-08 23:31:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 700 transitions. [2024-11-08 23:31:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:31:28,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 23:31:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 570 states and 720 transitions. [2024-11-08 23:31:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 720 transitions. [2024-11-08 23:31:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 23:31:29,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:31:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 577 states and 727 transitions. [2024-11-08 23:31:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 727 transitions. [2024-11-08 23:31:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 23:31:29,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:31:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 608 states and 762 transitions. [2024-11-08 23:31:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 762 transitions. [2024-11-08 23:31:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 23:31:30,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 618 states and 772 transitions. [2024-11-08 23:31:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 772 transitions. [2024-11-08 23:31:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 23:31:30,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 23:31:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 621 states and 775 transitions. [2024-11-08 23:31:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 775 transitions. [2024-11-08 23:31:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 23:31:30,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 700 states and 860 transitions. [2024-11-08 23:31:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 860 transitions. [2024-11-08 23:31:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 23:31:31,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 717 states and 877 transitions. [2024-11-08 23:31:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 877 transitions. [2024-11-08 23:31:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 23:31:32,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 727 states and 886 transitions. [2024-11-08 23:31:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 886 transitions. [2024-11-08 23:31:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:31:32,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 744 states and 902 transitions. [2024-11-08 23:31:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 902 transitions. [2024-11-08 23:31:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:31:33,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 23:31:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 768 states and 929 transitions. [2024-11-08 23:31:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 929 transitions. [2024-11-08 23:31:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:31:33,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 23:31:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 777 states and 939 transitions. [2024-11-08 23:31:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 939 transitions. [2024-11-08 23:31:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:31:34,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:31:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 799 states and 962 transitions. [2024-11-08 23:31:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 962 transitions. [2024-11-08 23:31:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 23:31:34,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 812 states and 981 transitions. [2024-11-08 23:31:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 981 transitions. [2024-11-08 23:31:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:31:35,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 857 states and 1035 transitions. [2024-11-08 23:31:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1035 transitions. [2024-11-08 23:31:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:31:36,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 874 states and 1052 transitions. [2024-11-08 23:31:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1052 transitions. [2024-11-08 23:31:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:31:36,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 884 states and 1061 transitions. [2024-11-08 23:31:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1061 transitions. [2024-11-08 23:31:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:31:37,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 921 states and 1098 transitions. [2024-11-08 23:31:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1098 transitions. [2024-11-08 23:31:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:31:37,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:37,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 969 states and 1156 transitions. [2024-11-08 23:31:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1156 transitions. [2024-11-08 23:31:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:31:39,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 986 states and 1173 transitions. [2024-11-08 23:31:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1173 transitions. [2024-11-08 23:31:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:31:40,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:31:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 996 states and 1182 transitions. [2024-11-08 23:31:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1182 transitions. [2024-11-08 23:31:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:31:40,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 23:31:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1008 states and 1195 transitions. [2024-11-08 23:31:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1195 transitions. [2024-11-08 23:31:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:31:40,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 23:31:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1045 states and 1233 transitions. [2024-11-08 23:31:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1233 transitions. [2024-11-08 23:31:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:31:41,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 23:31:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1052 states and 1239 transitions. [2024-11-08 23:31:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1239 transitions. [2024-11-08 23:31:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:31:41,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 23:31:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1054 states and 1243 transitions. [2024-11-08 23:31:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1243 transitions. [2024-11-08 23:31:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:31:42,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:42,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 23:31:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1055 states and 1243 transitions. [2024-11-08 23:31:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1243 transitions. [2024-11-08 23:31:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:31:42,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 23:31:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1056 states and 1243 transitions. [2024-11-08 23:31:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1243 transitions. [2024-11-08 23:31:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:31:43,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 23:31:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1057 states and 1243 transitions. [2024-11-08 23:31:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1243 transitions. [2024-11-08 23:31:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 23:31:43,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-08 23:31:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1094 states and 1279 transitions. [2024-11-08 23:31:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1279 transitions. [2024-11-08 23:31:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 23:31:43,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 23:31:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1194 states and 1384 transitions. [2024-11-08 23:31:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1384 transitions. [2024-11-08 23:31:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 23:31:45,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 23:31:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1201 states and 1390 transitions. [2024-11-08 23:31:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1390 transitions. [2024-11-08 23:31:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-08 23:31:46,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 23:31:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1214 states and 1403 transitions. [2024-11-08 23:31:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1403 transitions. [2024-11-08 23:31:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-08 23:31:46,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:46,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-08 23:31:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1271 states and 1465 transitions. [2024-11-08 23:31:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1465 transitions. [2024-11-08 23:31:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-08 23:31:48,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 23:31:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1407 states and 1611 transitions. [2024-11-08 23:31:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1611 transitions. [2024-11-08 23:31:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-08 23:31:51,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 23:31:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1437 states and 1641 transitions. [2024-11-08 23:31:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1641 transitions. [2024-11-08 23:31:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-08 23:31:53,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 23:31:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1360 states and 1544 transitions. [2024-11-08 23:31:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1544 transitions. [2024-11-08 23:31:56,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:31:56,111 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 54 iterations. [2024-11-08 23:31:56,120 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 23:32:03,583 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,584 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,584 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,584 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,584 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,585 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,585 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,585 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,585 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,585 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,586 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,586 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,586 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,587 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,587 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,587 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,587 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,588 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,588 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,588 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,589 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,589 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,589 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,589 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,590 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,590 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,590 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:32:03,590 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,591 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,591 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,591 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,591 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,592 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,592 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,592 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,592 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,593 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 482) no Hoare annotation was computed. [2024-11-08 23:32:03,593 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,593 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,593 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,594 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,594 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,594 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,594 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,594 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,595 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,595 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,595 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,595 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,596 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,596 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,596 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,596 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,597 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,597 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,597 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-08 23:32:03,597 INFO L77 FloydHoareUtils]: At program point L478-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-08 23:32:03,600 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,600 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,600 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,600 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,600 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L481-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-08 23:32:03,601 INFO L75 FloydHoareUtils]: For program point L482(line 482) no Hoare annotation was computed. [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,601 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,602 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,603 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,603 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,606 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:32:03,607 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,607 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,607 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,607 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,608 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,608 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,608 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-08 23:32:03,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:32:03 ImpRootNode [2024-11-08 23:32:03,633 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:32:03,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:32:03,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:32:03,638 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:32:03,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:17" (3/4) ... [2024-11-08 23:32:03,641 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:32:03,669 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-08 23:32:03,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 23:32:03,675 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 23:32:03,676 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:32:03,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:32:03,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:32:03,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:32:03,877 INFO L158 Benchmark]: Toolchain (without parser) took 49511.72ms. Allocated memory was 195.0MB in the beginning and 841.0MB in the end (delta: 645.9MB). Free memory was 159.2MB in the beginning and 631.9MB in the end (delta: -472.7MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,877 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:32:03,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.71ms. Allocated memory is still 195.0MB. Free memory was 158.8MB in the beginning and 130.2MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.61ms. Allocated memory is still 195.0MB. Free memory was 130.2MB in the beginning and 124.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,879 INFO L158 Benchmark]: Boogie Preprocessor took 100.14ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 120.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,879 INFO L158 Benchmark]: RCFGBuilder took 1746.36ms. Allocated memory is still 195.0MB. Free memory was 120.2MB in the beginning and 132.0MB in the end (delta: -11.8MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,883 INFO L158 Benchmark]: CodeCheck took 46630.66ms. Allocated memory was 195.0MB in the beginning and 841.0MB in the end (delta: 645.9MB). Free memory was 132.0MB in the beginning and 645.6MB in the end (delta: -513.5MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,883 INFO L158 Benchmark]: Witness Printer took 241.31ms. Allocated memory is still 841.0MB. Free memory was 644.5MB in the beginning and 631.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:32:03,885 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: 39.1s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73839 SdHoareTripleChecker+Valid, 234.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73370 mSDsluCounter, 11397 SdHoareTripleChecker+Invalid, 194.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9556 mSDsCounter, 26272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167802 IncrementalHoareTripleChecker+Invalid, 194074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26272 mSolverCounterUnsat, 1841 mSDtfsCounter, 167802 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56151 GetRequests, 54685 SyntacticMatches, 1090 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76172 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 8055 NumberOfCodeBlocks, 8055 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 8002 ConstructedInterpolants, 0 QuantifiedInterpolants, 24017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 47 PerfectInterpolantSequences, 5542/5680 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 482]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.71ms. Allocated memory is still 195.0MB. Free memory was 158.8MB in the beginning and 130.2MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.61ms. Allocated memory is still 195.0MB. Free memory was 130.2MB in the beginning and 124.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.14ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 120.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1746.36ms. Allocated memory is still 195.0MB. Free memory was 120.2MB in the beginning and 132.0MB in the end (delta: -11.8MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * CodeCheck took 46630.66ms. Allocated memory was 195.0MB in the beginning and 841.0MB in the end (delta: 645.9MB). Free memory was 132.0MB in the beginning and 645.6MB in the end (delta: -513.5MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. * Witness Printer took 241.31ms. Allocated memory is still 841.0MB. Free memory was 644.5MB in the beginning and 631.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 23:32:03,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24d4f344-a9ba-428c-ba7c-9429e7e265e0/bin/ukojak-verify-ImItNfHLgk/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