./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:50:42,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:50:42,676 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:50:42,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:50:42,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:50:42,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:50:42,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:50:42,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:50:42,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:50:42,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:50:42,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:50:42,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:50:42,710 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:50:42,710 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:50:42,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:50:42,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:50:42,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732 [2024-12-06 01:50:42,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:50:42,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:50:42,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:50:43,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:50:43,001 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:50:43,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c [2024-12-06 01:50:46,416 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/data/cfeda3646/6e52cb507c0f4eba89bd22367e048588/FLAGf2b193be0 [2024-12-06 01:50:46,715 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:50:46,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/sv-benchmarks/c/eca-rers2012/Problem02_label51.c [2024-12-06 01:50:46,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/data/cfeda3646/6e52cb507c0f4eba89bd22367e048588/FLAGf2b193be0 [2024-12-06 01:50:46,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/data/cfeda3646/6e52cb507c0f4eba89bd22367e048588 [2024-12-06 01:50:46,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:50:46,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:50:46,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:50:46,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:50:46,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:50:46,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:46" (1/1) ... [2024-12-06 01:50:46,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da10570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:46, skipping insertion in model container [2024-12-06 01:50:46,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:46" (1/1) ... [2024-12-06 01:50:46,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:50:47,105 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_0640f48a-5f23-4c62-943e-c95e4eaf727d/sv-benchmarks/c/eca-rers2012/Problem02_label51.c[17924,17937] [2024-12-06 01:50:47,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:50:47,147 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:50:47,235 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_0640f48a-5f23-4c62-943e-c95e4eaf727d/sv-benchmarks/c/eca-rers2012/Problem02_label51.c[17924,17937] [2024-12-06 01:50:47,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:50:47,262 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:50:47,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47 WrapperNode [2024-12-06 01:50:47,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:50:47,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:50:47,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:50:47,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:50:47,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,335 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 01:50:47,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:50:47,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:50:47,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:50:47,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:50:47,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:50:47,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:50:47,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:50:47,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:50:47,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:47" (1/1) ... [2024-12-06 01:50:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:50:47,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:50:47,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:50:47,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:50:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:50:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:50:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:50:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:50:47,560 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:50:47,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:50:48,592 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 01:50:48,592 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:50:48,903 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:50:48,903 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 01:50:48,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:48 BoogieIcfgContainer [2024-12-06 01:50:48,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:50:48,904 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:50:48,904 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:50:48,914 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:50:48,914 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:48" (1/1) ... [2024-12-06 01:50:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:50:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 01:50:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 01:50:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 01:50:48,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 01:50:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 01:50:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 01:50:49,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 01:50:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 01:50:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:50:50,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 01:50:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 01:50:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:50:51,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 01:50:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 01:50:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:50:51,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 01:50:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 01:50:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 01:50:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 01:50:51,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 01:50:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 01:50:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:50:51,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 01:50:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 01:50:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 01:50:51,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 01:50:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 01:50:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 01:50:52,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-12-06 01:50:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-12-06 01:50:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 01:50:53,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 410 states and 522 transitions. [2024-12-06 01:50:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 522 transitions. [2024-12-06 01:50:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 01:50:53,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:50:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 428 states and 542 transitions. [2024-12-06 01:50:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 542 transitions. [2024-12-06 01:50:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 01:50:53,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 442 states and 557 transitions. [2024-12-06 01:50:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2024-12-06 01:50:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 01:50:53,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 449 states and 564 transitions. [2024-12-06 01:50:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 564 transitions. [2024-12-06 01:50:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 01:50:54,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 01:50:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 455 states and 572 transitions. [2024-12-06 01:50:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 572 transitions. [2024-12-06 01:50:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 01:50:54,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 462 states and 579 transitions. [2024-12-06 01:50:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 579 transitions. [2024-12-06 01:50:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:50:54,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 484 states and 607 transitions. [2024-12-06 01:50:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 607 transitions. [2024-12-06 01:50:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 01:50:54,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 01:50:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 499 states and 625 transitions. [2024-12-06 01:50:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2024-12-06 01:50:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:50:55,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 01:50:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 530 states and 658 transitions. [2024-12-06 01:50:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 658 transitions. [2024-12-06 01:50:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 01:50:55,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:50:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 554 states and 686 transitions. [2024-12-06 01:50:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 686 transitions. [2024-12-06 01:50:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:50:56,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 01:50:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 557 states and 689 transitions. [2024-12-06 01:50:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 689 transitions. [2024-12-06 01:50:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:50:56,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 636 states and 775 transitions. [2024-12-06 01:50:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 775 transitions. [2024-12-06 01:50:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 01:50:57,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:50:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 653 states and 791 transitions. [2024-12-06 01:50:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 791 transitions. [2024-12-06 01:50:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:50:57,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:50:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 684 states and 828 transitions. [2024-12-06 01:50:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 828 transitions. [2024-12-06 01:50:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 01:50:58,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:50:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 717 states and 864 transitions. [2024-12-06 01:50:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 864 transitions. [2024-12-06 01:50:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 01:50:58,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:50:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 736 states and 883 transitions. [2024-12-06 01:50:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 883 transitions. [2024-12-06 01:50:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 01:50:58,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 01:50:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 739 states and 886 transitions. [2024-12-06 01:50:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2024-12-06 01:50:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 01:50:59,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:50:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 765 states and 917 transitions. [2024-12-06 01:50:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 917 transitions. [2024-12-06 01:50:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 01:50:59,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:51:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 796 states and 952 transitions. [2024-12-06 01:51:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 952 transitions. [2024-12-06 01:51:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 01:51:00,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:51:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 803 states and 959 transitions. [2024-12-06 01:51:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 959 transitions. [2024-12-06 01:51:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 01:51:00,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 846 states and 1007 transitions. [2024-12-06 01:51:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1007 transitions. [2024-12-06 01:51:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 01:51:01,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:51:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 849 states and 1010 transitions. [2024-12-06 01:51:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1010 transitions. [2024-12-06 01:51:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 01:51:01,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 01:51:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 858 states and 1019 transitions. [2024-12-06 01:51:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1019 transitions. [2024-12-06 01:51:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 01:51:01,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:51:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 895 states and 1058 transitions. [2024-12-06 01:51:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1058 transitions. [2024-12-06 01:51:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 01:51:02,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 01:51:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 897 states and 1061 transitions. [2024-12-06 01:51:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1061 transitions. [2024-12-06 01:51:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 01:51:02,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:51:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 898 states and 1061 transitions. [2024-12-06 01:51:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1061 transitions. [2024-12-06 01:51:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 01:51:02,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 924 states and 1090 transitions. [2024-12-06 01:51:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1090 transitions. [2024-12-06 01:51:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 01:51:03,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:51:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 925 states and 1090 transitions. [2024-12-06 01:51:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1090 transitions. [2024-12-06 01:51:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 01:51:03,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 01:51:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 994 states and 1167 transitions. [2024-12-06 01:51:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1167 transitions. [2024-12-06 01:51:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 01:51:05,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:51:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1007 states and 1180 transitions. [2024-12-06 01:51:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1180 transitions. [2024-12-06 01:51:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:51:05,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-12-06 01:51:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1092 states and 1272 transitions. [2024-12-06 01:51:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1272 transitions. [2024-12-06 01:51:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 01:51:07,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 01:51:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1163 states and 1350 transitions. [2024-12-06 01:51:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1350 transitions. [2024-12-06 01:51:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-12-06 01:51:08,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:51:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1196 states and 1387 transitions. [2024-12-06 01:51:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1387 transitions. [2024-12-06 01:51:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 01:51:09,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:51:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1197 states and 1387 transitions. [2024-12-06 01:51:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1387 transitions. [2024-12-06 01:51:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 01:51:09,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 212 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 01:51:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1279 states and 1480 transitions. [2024-12-06 01:51:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1480 transitions. [2024-12-06 01:51:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 01:51:11,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1330 states and 1533 transitions. [2024-12-06 01:51:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1533 transitions. [2024-12-06 01:51:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 01:51:12,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1343 states and 1545 transitions. [2024-12-06 01:51:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1545 transitions. [2024-12-06 01:51:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 01:51:13,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 01:51:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1386 states and 1592 transitions. [2024-12-06 01:51:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1592 transitions. [2024-12-06 01:51:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 01:51:13,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 01:51:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1464 states and 1673 transitions. [2024-12-06 01:51:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1673 transitions. [2024-12-06 01:51:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 01:51:15,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 01:51:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1467 states and 1675 transitions. [2024-12-06 01:51:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1675 transitions. [2024-12-06 01:51:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 01:51:15,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 167 proven. 4 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-06 01:51:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1486 states and 1697 transitions. [2024-12-06 01:51:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1697 transitions. [2024-12-06 01:51:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 01:51:17,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 01:51:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1494 states and 1705 transitions. [2024-12-06 01:51:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1705 transitions. [2024-12-06 01:51:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-12-06 01:51:17,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 01:51:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1620 states and 1840 transitions. [2024-12-06 01:51:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1840 transitions. [2024-12-06 01:51:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-12-06 01:51:20,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 01:51:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1640 states and 1859 transitions. [2024-12-06 01:51:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1859 transitions. [2024-12-06 01:51:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-12-06 01:51:21,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-06 01:51:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1651 states and 1873 transitions. [2024-12-06 01:51:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1873 transitions. [2024-12-06 01:51:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 01:51:21,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 01:51:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1676 states and 1903 transitions. [2024-12-06 01:51:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1903 transitions. [2024-12-06 01:51:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 01:51:22,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 01:51:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1693 states and 1920 transitions. [2024-12-06 01:51:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1920 transitions. [2024-12-06 01:51:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 01:51:22,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 01:51:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 1786 states and 2021 transitions. [2024-12-06 01:51:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2021 transitions. [2024-12-06 01:51:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 01:51:25,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 01:51:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1802 states and 2035 transitions. [2024-12-06 01:51:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2035 transitions. [2024-12-06 01:51:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 01:51:26,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 01:51:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1805 states and 2037 transitions. [2024-12-06 01:51:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2037 transitions. [2024-12-06 01:51:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-12-06 01:51:26,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 01:51:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1808 states and 2039 transitions. [2024-12-06 01:51:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2039 transitions. [2024-12-06 01:51:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-12-06 01:51:26,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-12-06 01:51:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1810 states and 2043 transitions. [2024-12-06 01:51:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2043 transitions. [2024-12-06 01:51:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 01:51:27,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-12-06 01:51:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1480 states and 1676 transitions. [2024-12-06 01:51:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1676 transitions. [2024-12-06 01:51:27,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:51:27,970 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 63 iterations. [2024-12-06 01:51:27,976 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 01:51:34,142 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,143 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L508-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,144 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L511-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,145 INFO L75 FloydHoareUtils]: For program point L512(line 512) no Hoare annotation was computed. [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,145 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:51:34,146 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 512) no Hoare annotation was computed. [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,147 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,148 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,149 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,150 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-12-06 01:51:34,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:51:34 ImpRootNode [2024-12-06 01:51:34,161 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:51:34,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:51:34,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:51:34,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:51:34,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:48" (3/4) ... [2024-12-06 01:51:34,165 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:51:34,178 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-12-06 01:51:34,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 01:51:34,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 01:51:34,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:51:34,293 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:51:34,293 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:51:34,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:51:34,294 INFO L158 Benchmark]: Toolchain (without parser) took 47543.85ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 115.4MB in the beginning and 482.0MB in the end (delta: -366.6MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,294 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:51:34,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.12ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 89.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.13ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,295 INFO L158 Benchmark]: Boogie Preprocessor took 63.59ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:51:34,295 INFO L158 Benchmark]: RCFGBuilder took 1503.43ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 70.4MB in the end (delta: 9.8MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,295 INFO L158 Benchmark]: CodeCheck took 45257.07ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 70.4MB in the beginning and 494.2MB in the end (delta: -423.8MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,296 INFO L158 Benchmark]: Witness Printer took 131.28ms. Allocated memory is still 687.9MB. Free memory was 494.2MB in the beginning and 482.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:51:34,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 63, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110452 SdHoareTripleChecker+Valid, 267.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109902 mSDsluCounter, 15519 SdHoareTripleChecker+Invalid, 223.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13051 mSDsCounter, 33854 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245145 IncrementalHoareTripleChecker+Invalid, 278999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33854 mSolverCounterUnsat, 2468 mSDtfsCounter, 245145 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74390 GetRequests, 72499 SyntacticMatches, 1453 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106209 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 11137 NumberOfCodeBlocks, 11137 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 11075 ConstructedInterpolants, 0 QuantifiedInterpolants, 34278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 52 PerfectInterpolantSequences, 10350/10648 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 512]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.12ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 89.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.13ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.59ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1503.43ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 70.4MB in the end (delta: 9.8MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * CodeCheck took 45257.07ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 70.4MB in the beginning and 494.2MB in the end (delta: -423.8MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. * Witness Printer took 131.28ms. Allocated memory is still 687.9MB. Free memory was 494.2MB in the beginning and 482.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 01:51:34,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0640f48a-5f23-4c62-943e-c95e4eaf727d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE