./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm --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 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:33:33,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:33:33,291 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:33:33,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:33:33,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:33:33,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:33:33,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:33:33,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:33:33,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:33:33,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:33:33,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:33:33,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:33:33,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:33:33,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:33:33,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:33:33,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:33:33,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:33:33,331 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:33:33,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:33:33,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:33:33,331 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:33:33,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:33:33,332 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_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm 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 -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de [2024-11-13 22:33:33,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:33:33,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:33:33,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:33:33,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:33:33,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:33:33,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c Unable to find full path for "g++" [2024-11-13 22:33:35,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:33:36,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:33:36,046 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-13 22:33:36,067 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/data/79913b5a6/8fa63439524b4d549e109f3fb6a587a7/FLAG553ff5d0d [2024-11-13 22:33:36,093 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/data/79913b5a6/8fa63439524b4d549e109f3fb6a587a7 [2024-11-13 22:33:36,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:33:36,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:33:36,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:33:36,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:33:36,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:33:36,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab79b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36, skipping insertion in model container [2024-11-13 22:33:36,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:33:36,487 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_ba466c15-9602-494d-8c24-06819507d4aa/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-13 22:33:36,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:33:36,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:33:36,645 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_ba466c15-9602-494d-8c24-06819507d4aa/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-13 22:33:36,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:33:36,693 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:33:36,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36 WrapperNode [2024-11-13 22:33:36,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:33:36,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:33:36,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:33:36,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:33:36,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,783 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 22:33:36,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:33:36,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:33:36,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:33:36,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:33:36,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:33:36,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:33:36,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:33:36,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:33:36,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:33:36" (1/1) ... [2024-11-13 22:33:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:33:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:33:36,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:33:36,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:33:36,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:33:36,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:33:36,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:33:36,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:33:37,043 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:33:37,045 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:33:38,394 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 22:33:38,394 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:33:38,795 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:33:38,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:33:38,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:33:38 BoogieIcfgContainer [2024-11-13 22:33:38,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:33:38,800 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:33:38,800 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:33:38,812 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:33:38,812 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:33:38" (1/1) ... [2024-11-13 22:33:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:33:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 22:33:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 22:33:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:33:38,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:39,659 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-13 22:33:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-13 22:33:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-13 22:33:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:33:40,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-13 22:33:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-13 22:33:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 22:33:41,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-13 22:33:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-13 22:33:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:33:41,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-13 22:33:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-13 22:33:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 22:33:43,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-13 22:33:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-13 22:33:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 22:33:43,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-13 22:33:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-13 22:33:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 22:33:43,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-13 22:33:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-13 22:33:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 22:33:44,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-13 22:33:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-13 22:33:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 22:33:44,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-13 22:33:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-13 22:33:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 22:33:45,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-13 22:33:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-13 22:33:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 22:33:45,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:45,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-13 22:33:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-13 22:33:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 22:33:46,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-13 22:33:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-13 22:33:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 22:33:46,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-13 22:33:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-13 22:33:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 22:33:47,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-13 22:33:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-13 22:33:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 22:33:48,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-13 22:33:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-13 22:33:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 22:33:48,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-13 22:33:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-13 22:33:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 22:33:49,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:49,323 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-13 22:33:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-13 22:33:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-13 22:33:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 22:33:49,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:33:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-13 22:33:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-13 22:33:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:33:50,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-13 22:33:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-13 22:33:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 22:33:51,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-13 22:33:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-13 22:33:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:33:51,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-13 22:33:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-13 22:33:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 22:33:51,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-13 22:33:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-13 22:33:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:33:52,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 363 states and 472 transitions. [2024-11-13 22:33:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2024-11-13 22:33:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:33:53,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 367 states and 477 transitions. [2024-11-13 22:33:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 477 transitions. [2024-11-13 22:33:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:33:54,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:33:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 381 states and 491 transitions. [2024-11-13 22:33:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-13 22:33:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 22:33:54,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 383 states and 495 transitions. [2024-11-13 22:33:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-11-13 22:33:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 22:33:55,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 402 states and 516 transitions. [2024-11-13 22:33:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 516 transitions. [2024-11-13 22:33:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 22:33:55,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 404 states and 518 transitions. [2024-11-13 22:33:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2024-11-13 22:33:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 22:33:55,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 418 states and 532 transitions. [2024-11-13 22:33:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 532 transitions. [2024-11-13 22:33:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 22:33:56,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 426 states and 543 transitions. [2024-11-13 22:33:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 543 transitions. [2024-11-13 22:33:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 22:33:56,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 466 states and 585 transitions. [2024-11-13 22:33:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 585 transitions. [2024-11-13 22:33:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 22:33:57,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:33:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 471 states and 590 transitions. [2024-11-13 22:33:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 590 transitions. [2024-11-13 22:33:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 22:33:57,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:33:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 476 states and 596 transitions. [2024-11-13 22:33:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 596 transitions. [2024-11-13 22:33:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 22:33:58,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:33:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 479 states and 600 transitions. [2024-11-13 22:33:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2024-11-13 22:33:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 22:33:58,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:58,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:33:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 481 states and 603 transitions. [2024-11-13 22:33:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2024-11-13 22:33:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 22:33:59,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:33:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 484 states and 606 transitions. [2024-11-13 22:33:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2024-11-13 22:33:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:33:59,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 534 states and 661 transitions. [2024-11-13 22:34:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 661 transitions. [2024-11-13 22:34:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:34:01,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 536 states and 662 transitions. [2024-11-13 22:34:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 662 transitions. [2024-11-13 22:34:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 22:34:01,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:34:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 539 states and 665 transitions. [2024-11-13 22:34:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2024-11-13 22:34:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 22:34:01,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 559 states and 686 transitions. [2024-11-13 22:34:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 686 transitions. [2024-11-13 22:34:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:34:02,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 699 states and 841 transitions. [2024-11-13 22:34:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 841 transitions. [2024-11-13 22:34:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:34:04,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 768 states and 926 transitions. [2024-11-13 22:34:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 926 transitions. [2024-11-13 22:34:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 22:34:06,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 822 states and 987 transitions. [2024-11-13 22:34:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 987 transitions. [2024-11-13 22:34:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:34:09,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 839 states and 1006 transitions. [2024-11-13 22:34:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1006 transitions. [2024-11-13 22:34:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:34:10,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 841 states and 1007 transitions. [2024-11-13 22:34:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1007 transitions. [2024-11-13 22:34:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 22:34:11,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 854 states and 1022 transitions. [2024-11-13 22:34:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1022 transitions. [2024-11-13 22:34:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 22:34:11,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 22:34:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 868 states and 1039 transitions. [2024-11-13 22:34:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1039 transitions. [2024-11-13 22:34:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 22:34:12,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 22:34:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 889 states and 1058 transitions. [2024-11-13 22:34:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1058 transitions. [2024-11-13 22:34:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:34:12,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:34:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 919 states and 1091 transitions. [2024-11-13 22:34:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1091 transitions. [2024-11-13 22:34:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 22:34:14,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:34:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 933 states and 1104 transitions. [2024-11-13 22:34:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1104 transitions. [2024-11-13 22:34:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 22:34:14,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 963 states and 1138 transitions. [2024-11-13 22:34:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2024-11-13 22:34:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:34:16,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:34:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1009 states and 1191 transitions. [2024-11-13 22:34:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1191 transitions. [2024-11-13 22:34:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:34:17,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:34:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1010 states and 1191 transitions. [2024-11-13 22:34:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1191 transitions. [2024-11-13 22:34:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 22:34:17,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1081 states and 1278 transitions. [2024-11-13 22:34:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1278 transitions. [2024-11-13 22:34:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 22:34:19,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:34:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1082 states and 1278 transitions. [2024-11-13 22:34:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1278 transitions. [2024-11-13 22:34:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 22:34:20,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:34:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1175 states and 1393 transitions. [2024-11-13 22:34:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1393 transitions. [2024-11-13 22:34:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 22:34:23,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:34:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1177 states and 1396 transitions. [2024-11-13 22:34:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1396 transitions. [2024-11-13 22:34:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 22:34:23,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:34:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1202 states and 1423 transitions. [2024-11-13 22:34:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1423 transitions. [2024-11-13 22:34:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-13 22:34:24,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:34:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1229 states and 1453 transitions. [2024-11-13 22:34:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1453 transitions. [2024-11-13 22:34:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 22:34:26,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 22:34:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1256 states and 1483 transitions. [2024-11-13 22:34:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1483 transitions. [2024-11-13 22:34:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:34:26,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:34:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1285 states and 1514 transitions. [2024-11-13 22:34:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1514 transitions. [2024-11-13 22:34:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:34:27,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1301 states and 1531 transitions. [2024-11-13 22:34:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1531 transitions. [2024-11-13 22:34:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:34:29,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1306 states and 1535 transitions. [2024-11-13 22:34:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1535 transitions. [2024-11-13 22:34:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:34:29,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:34:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1338 states and 1568 transitions. [2024-11-13 22:34:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1568 transitions. [2024-11-13 22:34:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:34:32,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1352 states and 1586 transitions. [2024-11-13 22:34:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1586 transitions. [2024-11-13 22:34:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:34:33,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 22:34:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1380 states and 1617 transitions. [2024-11-13 22:34:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1617 transitions. [2024-11-13 22:34:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:34:35,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 22:34:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1393 states and 1628 transitions. [2024-11-13 22:34:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1628 transitions. [2024-11-13 22:34:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:34:36,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:34:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1553 states and 1810 transitions. [2024-11-13 22:34:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1810 transitions. [2024-11-13 22:34:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 22:34:41,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1583 states and 1855 transitions. [2024-11-13 22:34:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1855 transitions. [2024-11-13 22:34:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 22:34:42,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1584 states and 1855 transitions. [2024-11-13 22:34:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1855 transitions. [2024-11-13 22:34:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:34:43,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:34:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1649 states and 1938 transitions. [2024-11-13 22:34:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1938 transitions. [2024-11-13 22:34:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 22:34:45,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:34:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1650 states and 1938 transitions. [2024-11-13 22:34:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1938 transitions. [2024-11-13 22:34:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:34:46,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:34:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1663 states and 1953 transitions. [2024-11-13 22:34:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1953 transitions. [2024-11-13 22:34:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:34:46,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:34:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 1715 states and 2020 transitions. [2024-11-13 22:34:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2020 transitions. [2024-11-13 22:34:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:34:49,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 22:34:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1789 states and 2101 transitions. [2024-11-13 22:34:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2101 transitions. [2024-11-13 22:34:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:34:52,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:34:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1795 states and 2108 transitions. [2024-11-13 22:34:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2108 transitions. [2024-11-13 22:34:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 22:34:53,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:34:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 1804 states and 2121 transitions. [2024-11-13 22:34:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2121 transitions. [2024-11-13 22:34:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:34:53,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 22:34:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1848 states and 2172 transitions. [2024-11-13 22:34:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2172 transitions. [2024-11-13 22:34:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:34:55,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 22:34:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1849 states and 2174 transitions. [2024-11-13 22:34:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2174 transitions. [2024-11-13 22:34:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:34:56,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:56,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:34:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1862 states and 2188 transitions. [2024-11-13 22:34:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2188 transitions. [2024-11-13 22:34:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 22:34:57,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:34:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 22:34:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:34:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1896 states and 2224 transitions. [2024-11-13 22:34:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2224 transitions. [2024-11-13 22:34:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 22:34:59,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:34:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:34:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:35:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1994 states and 2330 transitions. [2024-11-13 22:35:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2330 transitions. [2024-11-13 22:35:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 22:35:03,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 145 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:35:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2011 states and 2347 transitions. [2024-11-13 22:35:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2347 transitions. [2024-11-13 22:35:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 22:35:03,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2024 states and 2362 transitions. [2024-11-13 22:35:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2362 transitions. [2024-11-13 22:35:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 22:35:04,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2041 states and 2379 transitions. [2024-11-13 22:35:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2379 transitions. [2024-11-13 22:35:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 22:35:05,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 22:35:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2063 states and 2401 transitions. [2024-11-13 22:35:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2401 transitions. [2024-11-13 22:35:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:35:05,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:35:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2090 states and 2430 transitions. [2024-11-13 22:35:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2430 transitions. [2024-11-13 22:35:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:35:07,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:35:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2119 states and 2465 transitions. [2024-11-13 22:35:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2465 transitions. [2024-11-13 22:35:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 22:35:09,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:35:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2134 states and 2488 transitions. [2024-11-13 22:35:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2488 transitions. [2024-11-13 22:35:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 22:35:11,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:35:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2149 states and 2503 transitions. [2024-11-13 22:35:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2503 transitions. [2024-11-13 22:35:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 22:35:12,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 22:35:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2164 states and 2532 transitions. [2024-11-13 22:35:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2532 transitions. [2024-11-13 22:35:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 22:35:14,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 22:35:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2179 states and 2547 transitions. [2024-11-13 22:35:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2547 transitions. [2024-11-13 22:35:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 22:35:15,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 22:35:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2181 states and 2554 transitions. [2024-11-13 22:35:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2554 transitions. [2024-11-13 22:35:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 22:35:16,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 22:35:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2209 states and 2581 transitions. [2024-11-13 22:35:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2581 transitions. [2024-11-13 22:35:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 22:35:17,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 178 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:35:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2295 states and 2683 transitions. [2024-11-13 22:35:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2683 transitions. [2024-11-13 22:35:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 22:35:22,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:35:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2323 states and 2714 transitions. [2024-11-13 22:35:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2714 transitions. [2024-11-13 22:35:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 22:35:24,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 22:35:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2349 states and 2741 transitions. [2024-11-13 22:35:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2741 transitions. [2024-11-13 22:35:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 22:35:26,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 22:35:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2358 states and 2749 transitions. [2024-11-13 22:35:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2749 transitions. [2024-11-13 22:35:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 22:35:26,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:35:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2466 states and 2875 transitions. [2024-11-13 22:35:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2875 transitions. [2024-11-13 22:35:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 22:35:29,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:35:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2503 states and 2923 transitions. [2024-11-13 22:35:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2923 transitions. [2024-11-13 22:35:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 22:35:33,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:35:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2529 states and 2958 transitions. [2024-11-13 22:35:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 2958 transitions. [2024-11-13 22:35:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 22:35:35,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:35:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2538 states and 2968 transitions. [2024-11-13 22:35:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 2968 transitions. [2024-11-13 22:35:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 22:35:36,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:35:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2547 states and 2980 transitions. [2024-11-13 22:35:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 2980 transitions. [2024-11-13 22:35:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:35:37,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:35:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2549 states and 2986 transitions. [2024-11-13 22:35:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 2986 transitions. [2024-11-13 22:35:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:35:38,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:35:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2554 states and 2992 transitions. [2024-11-13 22:35:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2992 transitions. [2024-11-13 22:35:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:35:39,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 22:35:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 2570 states and 3011 transitions. [2024-11-13 22:35:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3011 transitions. [2024-11-13 22:35:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:35:41,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 22:35:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 2571 states and 3013 transitions. [2024-11-13 22:35:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3013 transitions. [2024-11-13 22:35:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:41,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 22:35:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 2622 states and 3072 transitions. [2024-11-13 22:35:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3072 transitions. [2024-11-13 22:35:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:44,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:35:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 2658 states and 3110 transitions. [2024-11-13 22:35:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3110 transitions. [2024-11-13 22:35:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:46,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 2720 states and 3191 transitions. [2024-11-13 22:35:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3191 transitions. [2024-11-13 22:35:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:51,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 2729 states and 3201 transitions. [2024-11-13 22:35:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3201 transitions. [2024-11-13 22:35:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:51,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 2746 states and 3221 transitions. [2024-11-13 22:35:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3221 transitions. [2024-11-13 22:35:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:53,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 2763 states and 3238 transitions. [2024-11-13 22:35:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3238 transitions. [2024-11-13 22:35:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:35:54,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 22:35:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 2780 states and 3255 transitions. [2024-11-13 22:35:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3255 transitions. [2024-11-13 22:35:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 22:35:56,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 22:35:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 2782 states and 3259 transitions. [2024-11-13 22:35:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3259 transitions. [2024-11-13 22:35:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 22:35:57,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 22:35:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 2798 states and 3277 transitions. [2024-11-13 22:35:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3277 transitions. [2024-11-13 22:35:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 22:35:58,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 22:35:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 2812 states and 3290 transitions. [2024-11-13 22:35:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3290 transitions. [2024-11-13 22:35:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 22:35:59,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 22:36:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 2822 states and 3302 transitions. [2024-11-13 22:36:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3302 transitions. [2024-11-13 22:36:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:36:00,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 2891 states and 3383 transitions. [2024-11-13 22:36:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3383 transitions. [2024-11-13 22:36:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:36:05,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 2921 states and 3417 transitions. [2024-11-13 22:36:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3417 transitions. [2024-11-13 22:36:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:36:07,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:36:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 2932 states and 3429 transitions. [2024-11-13 22:36:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3429 transitions. [2024-11-13 22:36:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:36:08,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 2964 states and 3469 transitions. [2024-11-13 22:36:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3469 transitions. [2024-11-13 22:36:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:36:12,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:12,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3022 states and 3535 transitions. [2024-11-13 22:36:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 3535 transitions. [2024-11-13 22:36:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 22:36:15,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:36:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3028 states and 3542 transitions. [2024-11-13 22:36:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3542 transitions. [2024-11-13 22:36:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:36:16,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:36:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3067 states and 3582 transitions. [2024-11-13 22:36:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 3582 transitions. [2024-11-13 22:36:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:36:20,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 22:36:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3083 states and 3600 transitions. [2024-11-13 22:36:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3600 transitions. [2024-11-13 22:36:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:36:21,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 22:36:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3099 states and 3616 transitions. [2024-11-13 22:36:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3616 transitions. [2024-11-13 22:36:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:36:22,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 22:36:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3119 states and 3638 transitions. [2024-11-13 22:36:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 3638 transitions. [2024-11-13 22:36:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 22:36:24,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-13 22:36:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3135 states and 3654 transitions. [2024-11-13 22:36:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 3654 transitions. [2024-11-13 22:36:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 22:36:25,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 22:36:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3153 states and 3673 transitions. [2024-11-13 22:36:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 3673 transitions. [2024-11-13 22:36:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 22:36:26,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 22:36:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3164 states and 3684 transitions. [2024-11-13 22:36:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 3684 transitions. [2024-11-13 22:36:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 22:36:26,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3194 states and 3714 transitions. [2024-11-13 22:36:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3714 transitions. [2024-11-13 22:36:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 22:36:29,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:29,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 22:36:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3206 states and 3726 transitions. [2024-11-13 22:36:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 3726 transitions. [2024-11-13 22:36:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 22:36:30,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 22:36:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3220 states and 3742 transitions. [2024-11-13 22:36:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 3742 transitions. [2024-11-13 22:36:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 22:36:31,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 22:36:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3241 states and 3765 transitions. [2024-11-13 22:36:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 3765 transitions. [2024-11-13 22:36:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:36:33,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 22:36:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3261 states and 3784 transitions. [2024-11-13 22:36:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 3784 transitions. [2024-11-13 22:36:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:36:35,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:36:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3264 states and 3788 transitions. [2024-11-13 22:36:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 3788 transitions. [2024-11-13 22:36:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:36:36,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 22:36:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3391 states and 3931 transitions. [2024-11-13 22:36:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 3931 transitions. [2024-11-13 22:36:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-13 22:36:42,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 205 proven. 183 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:36:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3418 states and 3964 transitions. [2024-11-13 22:36:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3964 transitions. [2024-11-13 22:36:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-13 22:36:45,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:36:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 3536 states and 4095 transitions. [2024-11-13 22:36:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4095 transitions. [2024-11-13 22:36:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:36:52,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:36:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 3578 states and 4148 transitions. [2024-11-13 22:36:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4148 transitions. [2024-11-13 22:36:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:36:58,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:37:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 3595 states and 4166 transitions. [2024-11-13 22:37:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4166 transitions. [2024-11-13 22:37:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:37:00,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:37:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 3705 states and 4283 transitions. [2024-11-13 22:37:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 4283 transitions. [2024-11-13 22:37:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-13 22:37:07,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 369 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 22:37:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 3723 states and 4305 transitions. [2024-11-13 22:37:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 4305 transitions. [2024-11-13 22:37:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-13 22:37:10,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 22:37:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 3770 states and 4372 transitions. [2024-11-13 22:37:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4372 transitions. [2024-11-13 22:37:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-13 22:37:18,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 22:37:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 3775 states and 4381 transitions. [2024-11-13 22:37:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 4381 transitions. [2024-11-13 22:37:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-13 22:37:20,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 385 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 22:37:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 3793 states and 4405 transitions. [2024-11-13 22:37:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 4405 transitions. [2024-11-13 22:37:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 22:37:24,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 22:37:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 3802 states and 4416 transitions. [2024-11-13 22:37:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 4416 transitions. [2024-11-13 22:37:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 22:37:27,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:37:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:37:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:37:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 22:37:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:37:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 3859 states and 4485 transitions. [2024-11-13 22:37:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4485 transitions. [2024-11-13 22:37:39,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:37:39,414 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 150 iterations. [2024-11-13 22:37:39,424 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 22:38:28,592 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,593 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,593 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,593 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,594 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,594 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,594 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,594 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,595 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,595 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,595 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,595 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,596 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,596 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,596 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,596 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,597 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,597 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,597 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,597 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,598 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,598 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,598 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,598 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,598 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-13 22:38:28,599 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,599 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,599 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,600 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,600 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-13 22:38:28,600 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,600 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,601 INFO L75 FloydHoareUtils]: For program point L513(line 513) no Hoare annotation was computed. [2024-11-13 22:38:28,601 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,601 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,601 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,602 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,602 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,602 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,602 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,602 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,603 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,603 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,603 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,604 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,604 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,604 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,604 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,604 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,605 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:38:28,605 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,605 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 22:38:28,605 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,605 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:38:28,606 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,607 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,607 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,607 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,607 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,608 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,608 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,608 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,608 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,608 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 513) no Hoare annotation was computed. [2024-11-13 22:38:28,609 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,609 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,609 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,609 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,609 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 22:38:28,610 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 22:38:28,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:38:28 ImpRootNode [2024-11-13 22:38:28,634 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:38:28,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:38:28,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:38:28,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:38:28,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:33:38" (3/4) ... [2024-11-13 22:38:28,637 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:38:28,651 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 22:38:28,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 22:38:28,653 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 22:38:28,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:38:28,786 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:38:28,786 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:38:28,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:38:28,788 INFO L158 Benchmark]: Toolchain (without parser) took 292689.02ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 91.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-13 22:38:28,788 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:38:28,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.94ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 63.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:38:28,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.06ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:38:28,790 INFO L158 Benchmark]: Boogie Preprocessor took 82.88ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:38:28,791 INFO L158 Benchmark]: RCFGBuilder took 1930.57ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.4MB in the beginning and 259.6MB in the end (delta: -205.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-13 22:38:28,793 INFO L158 Benchmark]: CodeCheck took 289834.21ms. Allocated memory was 352.3MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 259.6MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-13 22:38:28,794 INFO L158 Benchmark]: Witness Printer took 151.89ms. Allocated memory is still 3.3GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:38:28,796 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 240.6s, OverallIterations: 150, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 539161 SdHoareTripleChecker+Valid, 1443.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536774 mSDsluCounter, 71115 SdHoareTripleChecker+Invalid, 1236.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60600 mSDsCounter, 93889 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132185 IncrementalHoareTripleChecker+Invalid, 1226074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93889 mSolverCounterUnsat, 10515 mSDtfsCounter, 1132185 mSolverCounterSat, 13.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191986 GetRequests, 183288 SyntacticMatches, 7320 SemanticMatches, 1378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231934 ImplicationChecksByTransitivity, 171.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 28633 NumberOfCodeBlocks, 28633 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 28484 ConstructedInterpolants, 0 QuantifiedInterpolants, 151156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 149 InterpolantComputations, 73 PerfectInterpolantSequences, 27920/33513 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 513]: 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: 40]: Location Invariant Derived location invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.94ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 63.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.06ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.88ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1930.57ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.4MB in the beginning and 259.6MB in the end (delta: -205.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * CodeCheck took 289834.21ms. Allocated memory was 352.3MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 259.6MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 151.89ms. Allocated memory is still 3.3GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 22:38:28,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba466c15-9602-494d-8c24-06819507d4aa/bin/ukojak-verify-EEHR8qb7sm/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