./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.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_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3 --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 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:00:23,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:00:23,137 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:00:23,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:00:23,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:00:23,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:00:23,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:00:23,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:00:23,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:00:23,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:00:23,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:00:23,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:00:23,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:00:23,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:00:23,185 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:00:23,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:00:23,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:00:23,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:00:23,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:00:23,186 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:00:23,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:00:23,186 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_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3 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 -> 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 [2024-11-25 03:00:23,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:00:23,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:00:23,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:00:23,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:00:23,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:00:23,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2024-11-25 03:00:26,444 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/data/3b3ccb2c3/2ac01294827f41fb85551a5dd4720ecf/FLAG9ab91e1a5 [2024-11-25 03:00:26,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:00:26,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2024-11-25 03:00:26,798 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/data/3b3ccb2c3/2ac01294827f41fb85551a5dd4720ecf/FLAG9ab91e1a5 [2024-11-25 03:00:26,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/data/3b3ccb2c3/2ac01294827f41fb85551a5dd4720ecf [2024-11-25 03:00:26,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:00:26,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:00:26,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:00:26,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:00:26,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:00:26,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:00:26" (1/1) ... [2024-11-25 03:00:26,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b89ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:26, skipping insertion in model container [2024-11-25 03:00:26,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:00:26" (1/1) ... [2024-11-25 03:00:26,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:00:27,190 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_8aef4736-fc99-47ae-9e14-bc776e945c2a/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2024-11-25 03:00:27,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:00:27,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:00:27,309 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_8aef4736-fc99-47ae-9e14-bc776e945c2a/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2024-11-25 03:00:27,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:00:27,329 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:00:27,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27 WrapperNode [2024-11-25 03:00:27,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:00:27,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:00:27,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:00:27,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:00:27,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,429 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 03:00:27,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:00:27,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:00:27,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:00:27,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:00:27,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:00:27,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:00:27,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:00:27,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:00:27,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:00:27" (1/1) ... [2024-11-25 03:00:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:00:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:00:27,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:00:27,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:00:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:00:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:00:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:00:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:00:27,687 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:00:27,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:00:29,064 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 03:00:29,064 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:00:29,429 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:00:29,429 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:00:29,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:00:29 BoogieIcfgContainer [2024-11-25 03:00:29,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:00:29,430 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:00:29,430 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:00:29,442 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:00:29,442 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:00:29" (1/1) ... [2024-11-25 03:00:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:00:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 03:00:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 03:00:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 03:00:29,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-25 03:00:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-25 03:00:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 03:00:30,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 246 states and 356 transitions. [2024-11-25 03:00:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 356 transitions. [2024-11-25 03:00:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-25 03:00:33,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 325 states and 443 transitions. [2024-11-25 03:00:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 443 transitions. [2024-11-25 03:00:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 03:00:34,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 330 states and 449 transitions. [2024-11-25 03:00:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 449 transitions. [2024-11-25 03:00:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 03:00:34,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 412 states and 544 transitions. [2024-11-25 03:00:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 544 transitions. [2024-11-25 03:00:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 03:00:37,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 417 states and 549 transitions. [2024-11-25 03:00:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 549 transitions. [2024-11-25 03:00:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 03:00:38,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 424 states and 556 transitions. [2024-11-25 03:00:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 556 transitions. [2024-11-25 03:00:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:00:38,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 524 states and 661 transitions. [2024-11-25 03:00:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 661 transitions. [2024-11-25 03:00:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:00:40,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 529 states and 666 transitions. [2024-11-25 03:00:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 666 transitions. [2024-11-25 03:00:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 03:00:40,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 530 states and 667 transitions. [2024-11-25 03:00:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 667 transitions. [2024-11-25 03:00:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-25 03:00:40,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:40,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 609 states and 750 transitions. [2024-11-25 03:00:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 750 transitions. [2024-11-25 03:00:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-25 03:00:43,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 687 states and 830 transitions. [2024-11-25 03:00:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 830 transitions. [2024-11-25 03:00:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-25 03:00:44,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:00:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 709 states and 856 transitions. [2024-11-25 03:00:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 856 transitions. [2024-11-25 03:00:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-25 03:00:45,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 03:00:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 733 states and 883 transitions. [2024-11-25 03:00:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 883 transitions. [2024-11-25 03:00:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:00:46,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 03:00:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 740 states and 890 transitions. [2024-11-25 03:00:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 890 transitions. [2024-11-25 03:00:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:00:46,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 03:00:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 744 states and 894 transitions. [2024-11-25 03:00:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 894 transitions. [2024-11-25 03:00:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 03:00:46,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 804 states and 959 transitions. [2024-11-25 03:00:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 959 transitions. [2024-11-25 03:00:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:00:47,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 836 states and 997 transitions. [2024-11-25 03:00:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 997 transitions. [2024-11-25 03:00:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:00:49,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-25 03:00:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 842 states and 1005 transitions. [2024-11-25 03:00:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1005 transitions. [2024-11-25 03:00:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:00:49,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 878 states and 1043 transitions. [2024-11-25 03:00:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1043 transitions. [2024-11-25 03:00:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:00:49,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 03:00:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 942 states and 1111 transitions. [2024-11-25 03:00:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1111 transitions. [2024-11-25 03:00:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 03:00:50,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 03:00:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 943 states and 1113 transitions. [2024-11-25 03:00:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1113 transitions. [2024-11-25 03:00:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 03:00:50,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:00:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1022 states and 1202 transitions. [2024-11-25 03:00:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1202 transitions. [2024-11-25 03:00:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 03:00:52,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 03:00:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1023 states and 1202 transitions. [2024-11-25 03:00:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1202 transitions. [2024-11-25 03:00:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:00:52,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 03:00:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1024 states and 1202 transitions. [2024-11-25 03:00:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1202 transitions. [2024-11-25 03:00:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:00:52,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-25 03:00:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1027 states and 1205 transitions. [2024-11-25 03:00:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1205 transitions. [2024-11-25 03:00:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:00:53,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:00:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1046 states and 1229 transitions. [2024-11-25 03:00:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1229 transitions. [2024-11-25 03:00:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:00:53,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:00:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1050 states and 1234 transitions. [2024-11-25 03:00:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1234 transitions. [2024-11-25 03:00:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:00:54,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:00:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1054 states and 1238 transitions. [2024-11-25 03:00:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1238 transitions. [2024-11-25 03:00:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:00:54,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:00:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1058 states and 1242 transitions. [2024-11-25 03:00:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1242 transitions. [2024-11-25 03:00:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-25 03:00:54,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 147 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-25 03:00:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1169 states and 1363 transitions. [2024-11-25 03:00:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1363 transitions. [2024-11-25 03:00:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-25 03:00:57,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:00:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1265 states and 1469 transitions. [2024-11-25 03:00:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1469 transitions. [2024-11-25 03:00:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 03:00:59,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:00:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-25 03:00:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:00:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1299 states and 1507 transitions. [2024-11-25 03:00:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1507 transitions. [2024-11-25 03:00:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 03:00:59,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:00:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:00:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-25 03:01:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1343 states and 1556 transitions. [2024-11-25 03:01:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1556 transitions. [2024-11-25 03:01:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 03:01:00,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-25 03:01:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1361 states and 1574 transitions. [2024-11-25 03:01:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1574 transitions. [2024-11-25 03:01:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 03:01:01,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-25 03:01:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1425 states and 1639 transitions. [2024-11-25 03:01:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1639 transitions. [2024-11-25 03:01:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:01:02,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:01:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1444 states and 1658 transitions. [2024-11-25 03:01:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1658 transitions. [2024-11-25 03:01:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 03:01:02,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-25 03:01:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1446 states and 1659 transitions. [2024-11-25 03:01:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1659 transitions. [2024-11-25 03:01:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 03:01:03,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 204 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:01:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1609 states and 1828 transitions. [2024-11-25 03:01:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1828 transitions. [2024-11-25 03:01:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-25 03:01:07,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-25 03:01:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1689 states and 1917 transitions. [2024-11-25 03:01:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 1917 transitions. [2024-11-25 03:01:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-25 03:01:08,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 03:01:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1767 states and 1996 transitions. [2024-11-25 03:01:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1996 transitions. [2024-11-25 03:01:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-25 03:01:10,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 189 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-25 03:01:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1889 states and 2139 transitions. [2024-11-25 03:01:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2139 transitions. [2024-11-25 03:01:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-25 03:01:13,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 280 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 03:01:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1993 states and 2246 transitions. [2024-11-25 03:01:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2246 transitions. [2024-11-25 03:01:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-25 03:01:16,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 299 proven. 51 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-25 03:01:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2074 states and 2331 transitions. [2024-11-25 03:01:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2331 transitions. [2024-11-25 03:01:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-25 03:01:19,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 273 proven. 64 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-25 03:01:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2120 states and 2379 transitions. [2024-11-25 03:01:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2379 transitions. [2024-11-25 03:01:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-25 03:01:22,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-25 03:01:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2192 states and 2452 transitions. [2024-11-25 03:01:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2452 transitions. [2024-11-25 03:01:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-25 03:01:23,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-25 03:01:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2270 states and 2531 transitions. [2024-11-25 03:01:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2531 transitions. [2024-11-25 03:01:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-25 03:01:24,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-25 03:01:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2286 states and 2548 transitions. [2024-11-25 03:01:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2548 transitions. [2024-11-25 03:01:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-25 03:01:25,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-25 03:01:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2309 states and 2570 transitions. [2024-11-25 03:01:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2570 transitions. [2024-11-25 03:01:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-25 03:01:25,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 70 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-25 03:01:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2387 states and 2648 transitions. [2024-11-25 03:01:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2648 transitions. [2024-11-25 03:01:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-25 03:01:27,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-25 03:01:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2446 states and 2708 transitions. [2024-11-25 03:01:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2708 transitions. [2024-11-25 03:01:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-25 03:01:29,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-25 03:01:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2505 states and 2767 transitions. [2024-11-25 03:01:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2767 transitions. [2024-11-25 03:01:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-25 03:01:31,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 312 proven. 154 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-25 03:01:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2537 states and 2800 transitions. [2024-11-25 03:01:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2800 transitions. [2024-11-25 03:01:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-25 03:01:32,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 423 proven. 88 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-25 03:01:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2659 states and 2926 transitions. [2024-11-25 03:01:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 2926 transitions. [2024-11-25 03:01:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-25 03:01:34,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 348 proven. 10 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-25 03:01:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2705 states and 2982 transitions. [2024-11-25 03:01:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 2982 transitions. [2024-11-25 03:01:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-25 03:01:36,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 456 proven. 58 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-25 03:01:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2737 states and 3016 transitions. [2024-11-25 03:01:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3016 transitions. [2024-11-25 03:01:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-25 03:01:38,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 268 proven. 138 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-25 03:01:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 2739 states and 3017 transitions. [2024-11-25 03:01:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3017 transitions. [2024-11-25 03:01:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-25 03:01:39,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-25 03:01:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 2756 states and 3035 transitions. [2024-11-25 03:01:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3035 transitions. [2024-11-25 03:01:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-25 03:01:40,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-25 03:01:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 2776 states and 3055 transitions. [2024-11-25 03:01:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3055 transitions. [2024-11-25 03:01:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-25 03:01:41,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 411 proven. 79 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-25 03:01:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 2804 states and 3082 transitions. [2024-11-25 03:01:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3082 transitions. [2024-11-25 03:01:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-25 03:01:42,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-25 03:01:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 2823 states and 3102 transitions. [2024-11-25 03:01:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3102 transitions. [2024-11-25 03:01:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-25 03:01:43,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 502 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-25 03:01:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 2874 states and 3152 transitions. [2024-11-25 03:01:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 3152 transitions. [2024-11-25 03:01:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-25 03:01:44,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 502 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-25 03:01:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 2924 states and 3201 transitions. [2024-11-25 03:01:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3201 transitions. [2024-11-25 03:01:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-25 03:01:44,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 502 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-25 03:01:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 2929 states and 3205 transitions. [2024-11-25 03:01:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3205 transitions. [2024-11-25 03:01:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-25 03:01:45,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 525 proven. 97 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-25 03:01:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 2980 states and 3255 transitions. [2024-11-25 03:01:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 3255 transitions. [2024-11-25 03:01:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-25 03:01:46,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 416 proven. 110 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:01:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 2982 states and 3257 transitions. [2024-11-25 03:01:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3257 transitions. [2024-11-25 03:01:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-25 03:01:47,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-25 03:01:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 2996 states and 3270 transitions. [2024-11-25 03:01:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3270 transitions. [2024-11-25 03:01:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-25 03:01:47,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 501 proven. 65 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-25 03:01:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 2997 states and 3273 transitions. [2024-11-25 03:01:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3273 transitions. [2024-11-25 03:01:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-25 03:01:48,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-25 03:01:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3139 states and 3423 transitions. [2024-11-25 03:01:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 3423 transitions. [2024-11-25 03:01:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-25 03:01:51,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-25 03:01:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3165 states and 3448 transitions. [2024-11-25 03:01:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 3448 transitions. [2024-11-25 03:01:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-25 03:01:52,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:01:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3243 states and 3526 transitions. [2024-11-25 03:01:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 3526 transitions. [2024-11-25 03:01:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-25 03:01:53,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:01:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3321 states and 3604 transitions. [2024-11-25 03:01:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 3604 transitions. [2024-11-25 03:01:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-25 03:01:54,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:01:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3399 states and 3682 transitions. [2024-11-25 03:01:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 3682 transitions. [2024-11-25 03:01:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-25 03:01:55,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:01:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:01:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2161 states and 2347 transitions. [2024-11-25 03:01:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2347 transitions. [2024-11-25 03:01:57,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:01:57,036 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 75 iterations. [2024-11-25 03:01:57,046 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 03:02:17,372 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,372 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,372 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,373 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,374 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,375 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,375 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,375 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,376 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,376 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,376 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,376 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,376 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,377 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,377 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,377 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,377 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:02:17,377 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,378 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,378 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,378 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,378 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,378 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,379 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,379 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,379 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,379 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,380 INFO L77 FloydHoareUtils]: At program point L598-1(lines 39 608) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1))) (let ((.cse2 (not .cse5)) (.cse3 (<= ~a28~0 9)) (.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse4 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 10)) (and .cse3 .cse2) (and .cse3 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5) (and .cse1 .cse4 (< ~a28~0 11) .cse5)))) [2024-11-25 03:02:17,381 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,381 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,381 INFO L77 FloydHoareUtils]: At program point L601-1(lines 39 608) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1))) (let ((.cse2 (not .cse5)) (.cse3 (<= ~a28~0 9)) (.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse4 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 10)) (and .cse3 .cse2) (and .cse3 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5) (and .cse1 .cse4 (< ~a28~0 11) .cse5)))) [2024-11-25 03:02:17,381 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,381 INFO L75 FloydHoareUtils]: For program point L602(line 602) no Hoare annotation was computed. [2024-11-25 03:02:17,382 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,382 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,382 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,382 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,382 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,383 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 03:02:17,384 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,384 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,384 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,384 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,384 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,385 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,385 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,385 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,385 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,386 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,386 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,386 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,386 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,386 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:02:17,387 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,388 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-11-25 03:02:17,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:02:17 ImpRootNode [2024-11-25 03:02:17,410 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:02:17,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:02:17,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:02:17,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:02:17,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:00:29" (3/4) ... [2024-11-25 03:02:17,415 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:02:17,439 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-25 03:02:17,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 03:02:17,443 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-25 03:02:17,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:02:17,597 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:02:17,597 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:02:17,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:02:17,598 INFO L158 Benchmark]: Toolchain (without parser) took 110780.45ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 115.8MB in the beginning and 878.1MB in the end (delta: -762.4MB). Peak memory consumption was 577.0MB. Max. memory is 16.1GB. [2024-11-25 03:02:17,598 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:02:17,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.20ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 90.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:02:17,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.30ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:02:17,600 INFO L158 Benchmark]: Boogie Preprocessor took 99.29ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 80.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:02:17,600 INFO L158 Benchmark]: RCFGBuilder took 1899.78ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 76.4MB in the end (delta: 4.0MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-25 03:02:17,601 INFO L158 Benchmark]: CodeCheck took 107979.74ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.4MB in the beginning and 886.5MB in the end (delta: -810.1MB). Peak memory consumption was 533.0MB. Max. memory is 16.1GB. [2024-11-25 03:02:17,602 INFO L158 Benchmark]: Witness Printer took 186.88ms. Allocated memory is still 1.5GB. Free memory was 886.5MB in the beginning and 878.1MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:02:17,604 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: 87.6s, OverallIterations: 75, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257534 SdHoareTripleChecker+Valid, 769.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257024 mSDsluCounter, 28136 SdHoareTripleChecker+Invalid, 657.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23944 mSDsCounter, 81243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571941 IncrementalHoareTripleChecker+Invalid, 653184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81243 mSolverCounterUnsat, 4192 mSDtfsCounter, 571941 mSolverCounterSat, 5.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123372 GetRequests, 118824 SyntacticMatches, 4016 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193451 ImplicationChecksByTransitivity, 44.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 18347 NumberOfCodeBlocks, 18347 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 18273 ConstructedInterpolants, 0 QuantifiedInterpolants, 75207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 51 PerfectInterpolantSequences, 24489/26183 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: 602]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((((a25 == 1) && (7 != a17)) && (a19 != 1)) && (a28 <= 10)) || ((a28 <= 9) && (a19 != 1))) || ((a28 <= 9) && (a17 <= 8))) || ((((7 != a17) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((11 <= a28) && (a25 == 1)) && (a19 == 1))) || (((((a28 == 10) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((((((a11 == 1) && (a19 != 1)) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((a25 == 1) && (7 != a17)) && (a19 != 1)) && (a28 <= 10)) || ((a28 <= 9) && (a19 != 1))) || ((a28 <= 9) && (a17 <= 8))) || ((((7 != a17) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((11 <= a28) && (a25 == 1)) && (a19 == 1))) || (((((a28 == 10) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((((((a11 == 1) && (a19 != 1)) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.20ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 90.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.30ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.29ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 80.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1899.78ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 76.4MB in the end (delta: 4.0MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * CodeCheck took 107979.74ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.4MB in the beginning and 886.5MB in the end (delta: -810.1MB). Peak memory consumption was 533.0MB. Max. memory is 16.1GB. * Witness Printer took 186.88ms. Allocated memory is still 1.5GB. Free memory was 886.5MB in the beginning and 878.1MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:02:17,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aef4736-fc99-47ae-9e14-bc776e945c2a/bin/ukojak-verify-ENZ3QT5qd3/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