./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label31.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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label31.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/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 a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:58:48,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:58:48,362 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:58:48,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:58:48,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:58:48,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:58:48,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:58:48,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:58:48,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:58:48,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:58:48,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:58:48,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:58:48,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:58:48,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:58:48,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:58:48,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:58:48,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:58:48,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:58:48,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:58:48,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:58:48,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:58:48,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:58:48,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:58:48,422 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:58:48,422 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:58:48,423 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:58:48,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:58:48,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:58:48,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:58:48,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:58:48,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:58:48,432 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:58:48,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:58:48,432 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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/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 -> a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 [2024-11-08 22:58:48,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:58:48,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:58:48,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:58:48,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:58:48,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:58:48,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem02_label31.c Unable to find full path for "g++" [2024-11-08 22:58:50,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:58:50,994 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:58:50,995 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/sv-benchmarks/c/eca-rers2012/Problem02_label31.c [2024-11-08 22:58:51,008 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/data/1a25a7af2/1afc5003b0e74a7398aa4a30fb3ca4ef/FLAGf90551df2 [2024-11-08 22:58:51,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/data/1a25a7af2/1afc5003b0e74a7398aa4a30fb3ca4ef [2024-11-08 22:58:51,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:58:51,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:58:51,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:51,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:58:51,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:58:51,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc73254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51, skipping insertion in model container [2024-11-08 22:58:51,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:58:51,496 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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-08 22:58:51,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:51,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:58:51,633 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_d6ab6cb1-186d-47e3-a242-45f8df9bb556/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-08 22:58:51,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:51,674 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:58:51,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51 WrapperNode [2024-11-08 22:58:51,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:51,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:51,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:58:51,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:58:51,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,786 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-08 22:58:51,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:51,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:58:51,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:58:51,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:58:51,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:58:51,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:58:51,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:58:51,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:58:51,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:51" (1/1) ... [2024-11-08 22:58:51,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:58:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:58:51,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:58:51,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:58:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:58:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:58:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:58:51,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:58:52,040 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:58:52,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:58:53,276 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 22:58:53,276 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:58:53,637 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:58:53,637 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:58:53,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:53 BoogieIcfgContainer [2024-11-08 22:58:53,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:58:53,639 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:58:53,640 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:58:53,651 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:58:53,652 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:53" (1/1) ... [2024-11-08 22:58:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-08 22:58:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-08 22:58:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 22:58:53,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:54,343 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 22:58:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-08 22:58:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-08 22:58:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 22:58:54,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:55,286 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 22:58:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-08 22:58:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-08 22:58:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 22:58:56,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:56,311 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 22:58:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-08 22:58:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-08 22:58:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 22:58:56,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:56,569 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 22:58:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-08 22:58:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-08 22:58:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:58:56,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:56,748 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 22:58:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-08 22:58:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-08 22:58:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 22:58:56,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:57,070 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 22:58:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-08 22:58:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-08 22:58:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:58:57,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:57,302 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 22:58:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-08 22:58:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-08 22:58:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 22:58:57,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:57,515 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 22:58:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-08 22:58:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-08 22:58:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 22:58:57,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:58,034 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 22:58:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-11-08 22:58:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-11-08 22:58:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 22:58:59,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:59:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 418 states and 534 transitions. [2024-11-08 22:59:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 534 transitions. [2024-11-08 22:59:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 22:59:00,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:00,580 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 22:59:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-08 22:59:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-08 22:59:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 22:59:00,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:00,974 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 22:59:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-08 22:59:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-08 22:59:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:59:01,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:01,712 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 22:59:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 467 states and 592 transitions. [2024-11-08 22:59:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 592 transitions. [2024-11-08 22:59:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:59:01,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:01,922 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 22:59:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 473 states and 600 transitions. [2024-11-08 22:59:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 600 transitions. [2024-11-08 22:59:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:59:02,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:02,288 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 22:59:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 486 states and 615 transitions. [2024-11-08 22:59:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 615 transitions. [2024-11-08 22:59:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:59:02,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:02,764 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 22:59:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 507 states and 641 transitions. [2024-11-08 22:59:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 641 transitions. [2024-11-08 22:59:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 22:59:03,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:59:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 521 states and 658 transitions. [2024-11-08 22:59:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 658 transitions. [2024-11-08 22:59:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 22:59:03,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:03,833 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 22:59:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 536 states and 678 transitions. [2024-11-08 22:59:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 678 transitions. [2024-11-08 22:59:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:59:04,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:04,611 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 22:59:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 543 states and 685 transitions. [2024-11-08 22:59:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 685 transitions. [2024-11-08 22:59:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 22:59:04,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:04,850 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 22:59:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 574 states and 718 transitions. [2024-11-08 22:59:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 718 transitions. [2024-11-08 22:59:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 22:59:05,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:59:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 598 states and 750 transitions. [2024-11-08 22:59:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 750 transitions. [2024-11-08 22:59:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:59:05,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:06,055 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 22:59:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-08 22:59:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-08 22:59:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:59:06,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:06,653 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 22:59:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 724 states and 882 transitions. [2024-11-08 22:59:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 882 transitions. [2024-11-08 22:59:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 22:59:08,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:08,639 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 22:59:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 737 states and 898 transitions. [2024-11-08 22:59:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 898 transitions. [2024-11-08 22:59:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:59:09,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:09,410 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 22:59:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 754 states and 918 transitions. [2024-11-08 22:59:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 918 transitions. [2024-11-08 22:59:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:59:10,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:10,310 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 22:59:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 760 states and 923 transitions. [2024-11-08 22:59:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 923 transitions. [2024-11-08 22:59:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 22:59:10,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:59:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 787 states and 952 transitions. [2024-11-08 22:59:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 952 transitions. [2024-11-08 22:59:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:59:10,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:11,019 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 22:59:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 809 states and 975 transitions. [2024-11-08 22:59:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 975 transitions. [2024-11-08 22:59:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:59:11,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:59:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 836 states and 1004 transitions. [2024-11-08 22:59:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1004 transitions. [2024-11-08 22:59:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:59:11,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:11,826 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 22:59:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 867 states and 1037 transitions. [2024-11-08 22:59:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1037 transitions. [2024-11-08 22:59:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:59:12,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:12,331 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 22:59:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 884 states and 1058 transitions. [2024-11-08 22:59:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1058 transitions. [2024-11-08 22:59:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:59:13,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:13,152 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 22:59:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 897 states and 1073 transitions. [2024-11-08 22:59:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1073 transitions. [2024-11-08 22:59:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:59:13,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:13,830 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 22:59:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 903 states and 1078 transitions. [2024-11-08 22:59:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1078 transitions. [2024-11-08 22:59:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 22:59:14,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:14,197 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 22:59:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 940 states and 1115 transitions. [2024-11-08 22:59:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1115 transitions. [2024-11-08 22:59:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:59:14,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:59:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 974 states and 1154 transitions. [2024-11-08 22:59:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1154 transitions. [2024-11-08 22:59:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:59:15,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:15,379 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 22:59:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 987 states and 1166 transitions. [2024-11-08 22:59:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1166 transitions. [2024-11-08 22:59:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:59:16,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:16,143 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 22:59:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1000 states and 1178 transitions. [2024-11-08 22:59:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1178 transitions. [2024-11-08 22:59:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:59:16,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:16,792 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 22:59:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1037 states and 1216 transitions. [2024-11-08 22:59:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1216 transitions. [2024-11-08 22:59:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:59:17,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:17,326 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 22:59:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1044 states and 1222 transitions. [2024-11-08 22:59:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1222 transitions. [2024-11-08 22:59:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 22:59:17,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:59:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1080 states and 1260 transitions. [2024-11-08 22:59:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1260 transitions. [2024-11-08 22:59:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 22:59:17,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:59:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1087 states and 1268 transitions. [2024-11-08 22:59:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1268 transitions. [2024-11-08 22:59:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 22:59:18,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:18,312 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 22:59:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1089 states and 1269 transitions. [2024-11-08 22:59:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1269 transitions. [2024-11-08 22:59:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:59:18,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:18,701 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 22:59:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1090 states and 1269 transitions. [2024-11-08 22:59:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1269 transitions. [2024-11-08 22:59:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 22:59:18,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:59:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1118 states and 1298 transitions. [2024-11-08 22:59:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1298 transitions. [2024-11-08 22:59:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 22:59:19,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1127 states and 1308 transitions. [2024-11-08 22:59:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1308 transitions. [2024-11-08 22:59:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:59:19,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:59:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1152 states and 1334 transitions. [2024-11-08 22:59:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1334 transitions. [2024-11-08 22:59:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 22:59:19,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1215 states and 1404 transitions. [2024-11-08 22:59:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1404 transitions. [2024-11-08 22:59:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:59:21,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 22:59:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1261 states and 1457 transitions. [2024-11-08 22:59:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1457 transitions. [2024-11-08 22:59:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:59:22,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 22:59:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1298 states and 1493 transitions. [2024-11-08 22:59:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1493 transitions. [2024-11-08 22:59:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:59:22,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 22:59:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1305 states and 1499 transitions. [2024-11-08 22:59:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1499 transitions. [2024-11-08 22:59:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:59:23,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:23,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:23,289 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 22:59:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1306 states and 1499 transitions. [2024-11-08 22:59:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1499 transitions. [2024-11-08 22:59:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 22:59:23,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1311 states and 1505 transitions. [2024-11-08 22:59:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1505 transitions. [2024-11-08 22:59:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 22:59:23,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1381 states and 1586 transitions. [2024-11-08 22:59:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1586 transitions. [2024-11-08 22:59:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 22:59:25,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:25,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1433 states and 1642 transitions. [2024-11-08 22:59:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1642 transitions. [2024-11-08 22:59:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 22:59:27,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1438 states and 1646 transitions. [2024-11-08 22:59:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1646 transitions. [2024-11-08 22:59:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 22:59:28,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:59:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1511 states and 1724 transitions. [2024-11-08 22:59:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1724 transitions. [2024-11-08 22:59:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:59:29,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 22:59:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1518 states and 1732 transitions. [2024-11-08 22:59:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1732 transitions. [2024-11-08 22:59:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 22:59:30,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 22:59:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1554 states and 1775 transitions. [2024-11-08 22:59:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1775 transitions. [2024-11-08 22:59:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 22:59:31,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 22:59:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1568 states and 1789 transitions. [2024-11-08 22:59:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1789 transitions. [2024-11-08 22:59:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:59:31,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 149 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 22:59:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1583 states and 1804 transitions. [2024-11-08 22:59:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1804 transitions. [2024-11-08 22:59:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:59:32,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1598 states and 1822 transitions. [2024-11-08 22:59:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1822 transitions. [2024-11-08 22:59:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:59:32,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 22:59:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1608 states and 1832 transitions. [2024-11-08 22:59:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1832 transitions. [2024-11-08 22:59:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 22:59:33,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 22:59:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1636 states and 1860 transitions. [2024-11-08 22:59:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1860 transitions. [2024-11-08 22:59:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:59:33,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 130 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:59:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1715 states and 1940 transitions. [2024-11-08 22:59:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1940 transitions. [2024-11-08 22:59:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 22:59:34,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 22:59:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1755 states and 1982 transitions. [2024-11-08 22:59:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1982 transitions. [2024-11-08 22:59:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-08 22:59:36,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 22:59:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1785 states and 2013 transitions. [2024-11-08 22:59:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2013 transitions. [2024-11-08 22:59:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-08 22:59:36,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-08 22:59:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1888 states and 2120 transitions. [2024-11-08 22:59:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2120 transitions. [2024-11-08 22:59:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-08 22:59:39,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 281 proven. 88 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 22:59:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1949 states and 2184 transitions. [2024-11-08 22:59:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2184 transitions. [2024-11-08 22:59:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-08 22:59:40,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 22:59:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2105 states and 2345 transitions. [2024-11-08 22:59:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2345 transitions. [2024-11-08 22:59:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-08 22:59:43,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 394 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 22:59:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2145 states and 2388 transitions. [2024-11-08 22:59:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2388 transitions. [2024-11-08 22:59:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-08 22:59:45,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:45,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 394 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 22:59:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2183 states and 2424 transitions. [2024-11-08 22:59:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2424 transitions. [2024-11-08 22:59:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-08 22:59:46,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 22:59:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2223 states and 2464 transitions. [2024-11-08 22:59:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2464 transitions. [2024-11-08 22:59:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-08 22:59:48,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 463 proven. 58 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 22:59:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2365 states and 2609 transitions. [2024-11-08 22:59:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2609 transitions. [2024-11-08 22:59:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 22:59:51,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 22:59:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2395 states and 2638 transitions. [2024-11-08 22:59:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2638 transitions. [2024-11-08 22:59:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 22:59:53,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 22:59:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2398 states and 2640 transitions. [2024-11-08 22:59:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2640 transitions. [2024-11-08 22:59:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-08 22:59:53,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-08 22:59:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1793 states and 1993 transitions. [2024-11-08 22:59:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 1993 transitions. [2024-11-08 22:59:54,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 22:59:54,254 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 77 iterations. [2024-11-08 22:59:54,264 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 23:00:15,754 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,754 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,754 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,755 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,755 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,760 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,761 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,761 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,761 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,761 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,761 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,762 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,762 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,762 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,762 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,763 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,766 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,767 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,767 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,768 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,768 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,768 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,768 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,769 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,769 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,769 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,769 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:00:15,769 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,770 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,770 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,770 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,770 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,771 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,771 INFO L77 FloydHoareUtils]: At program point L526-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (<= 9 ~a28~0) .cse0) (and (not (= 7 ~a17~0)) (<= ~a17~0 8) .cse0) (<= ~a28~0 7))) [2024-11-08 23:00:15,771 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,771 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,771 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,772 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2024-11-08 23:00:15,772 INFO L77 FloydHoareUtils]: At program point L529-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (<= 9 ~a28~0) .cse0) (and (not (= 7 ~a17~0)) (<= ~a17~0 8) .cse0) (<= ~a28~0 7))) [2024-11-08 23:00:15,772 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,772 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,772 INFO L75 FloydHoareUtils]: For program point L530(line 530) no Hoare annotation was computed. [2024-11-08 23:00:15,772 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,773 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,773 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,773 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,773 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,773 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,774 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,774 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,776 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,776 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,777 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,777 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,777 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,777 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,778 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,778 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,778 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-08 23:00:15,778 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,779 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,779 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,779 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,779 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,779 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,780 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,780 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,784 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,784 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,785 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,785 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,785 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,785 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,785 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,786 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,787 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,787 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,787 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,788 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,791 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-08 23:00:15,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:00:15 ImpRootNode [2024-11-08 23:00:15,822 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:00:15,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:00:15,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:00:15,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:00:15,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:53" (3/4) ... [2024-11-08 23:00:15,829 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:00:15,854 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-08 23:00:15,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:00:15,860 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 23:00:15,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:00:16,058 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:00:16,060 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:00:16,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:00:16,061 INFO L158 Benchmark]: Toolchain (without parser) took 85032.84ms. Allocated memory was 136.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 98.5MB in the beginning and 804.8MB in the end (delta: -706.3MB). Peak memory consumption was 624.6MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,062 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory was 106.1MB in the beginning and 105.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:00:16,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.08ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 69.6MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.98ms. Allocated memory is still 136.3MB. Free memory was 69.6MB in the beginning and 64.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,063 INFO L158 Benchmark]: Boogie Preprocessor took 60.69ms. Allocated memory is still 136.3MB. Free memory was 64.2MB in the beginning and 59.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,063 INFO L158 Benchmark]: RCFGBuilder took 1785.80ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 59.5MB in the beginning and 93.1MB in the end (delta: -33.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,064 INFO L158 Benchmark]: CodeCheck took 82183.06ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 93.1MB in the beginning and 817.4MB in the end (delta: -724.3MB). Peak memory consumption was 551.8MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,065 INFO L158 Benchmark]: Witness Printer took 237.91ms. Allocated memory is still 1.5GB. Free memory was 817.4MB in the beginning and 804.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:00:16,067 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: 60.6s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160677 SdHoareTripleChecker+Valid, 449.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160001 mSDsluCounter, 18502 SdHoareTripleChecker+Invalid, 380.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15518 mSDsCounter, 43483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354486 IncrementalHoareTripleChecker+Invalid, 397969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43483 mSolverCounterUnsat, 2984 mSDtfsCounter, 354486 mSolverCounterSat, 4.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92981 GetRequests, 90336 SyntacticMatches, 2177 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143116 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 13479 NumberOfCodeBlocks, 13479 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 13403 ConstructedInterpolants, 0 QuantifiedInterpolants, 41363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 62 PerfectInterpolantSequences, 12467/12889 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: 530]: 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: ((((((((((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9)) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || (a28 == 10)) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (10 < a28)) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9)) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || (a28 == 10)) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (10 < a28)) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory was 106.1MB in the beginning and 105.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.08ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 69.6MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.98ms. Allocated memory is still 136.3MB. Free memory was 69.6MB in the beginning and 64.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.69ms. Allocated memory is still 136.3MB. Free memory was 64.2MB in the beginning and 59.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1785.80ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 59.5MB in the beginning and 93.1MB in the end (delta: -33.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * CodeCheck took 82183.06ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 93.1MB in the beginning and 817.4MB in the end (delta: -724.3MB). Peak memory consumption was 551.8MB. Max. memory is 16.1GB. * Witness Printer took 237.91ms. Allocated memory is still 1.5GB. Free memory was 817.4MB in the beginning and 804.8MB 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:00:16,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab6cb1-186d-47e3-a242-45f8df9bb556/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE