./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.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_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/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_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/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_e701f861-a426-40dc-ae18-83b183c82edf/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 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:32:47,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:32:48,007 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:32:48,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:32:48,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:32:48,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:32:48,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:32:48,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:32:48,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:32:48,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:32:48,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:32:48,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:32:48,068 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:32:48,069 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:32:48,069 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:32:48,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:32:48,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:32:48,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:32:48,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:32:48,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:32:48,072 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:32:48,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:32:48,072 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_e701f861-a426-40dc-ae18-83b183c82edf/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 -> 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 [2024-11-13 21:32:48,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:32:48,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:32:48,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:32:48,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:32:48,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:32:48,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c Unable to find full path for "g++" [2024-11-13 21:32:50,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:32:50,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:32:50,892 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2024-11-13 21:32:50,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/data/bc4893785/b7c59e58123e4612819776ca81329b67/FLAG8cfb7808a [2024-11-13 21:32:50,936 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/data/bc4893785/b7c59e58123e4612819776ca81329b67 [2024-11-13 21:32:50,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:32:50,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:32:50,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:32:50,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:32:50,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:32:50,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:32:50" (1/1) ... [2024-11-13 21:32:50,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627a1726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:50, skipping insertion in model container [2024-11-13 21:32:50,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:32:50" (1/1) ... [2024-11-13 21:32:50,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:32:51,377 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_e701f861-a426-40dc-ae18-83b183c82edf/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-11-13 21:32:51,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:32:51,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:32:51,510 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_e701f861-a426-40dc-ae18-83b183c82edf/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-11-13 21:32:51,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:32:51,549 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:32:51,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51 WrapperNode [2024-11-13 21:32:51,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:32:51,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:32:51,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:32:51,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:32:51,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,641 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:32:51,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:32:51,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:32:51,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:32:51,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:32:51,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:32:51,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:32:51,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:32:51,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:32:51,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:32:51" (1/1) ... [2024-11-13 21:32:51,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:32:51,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:32:51,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:32:51,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:32:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:32:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:32:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:32:51,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:32:51,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:32:51,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:32:53,472 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:32:53,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:32:53,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:32:53,824 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:32:53,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:32:53 BoogieIcfgContainer [2024-11-13 21:32:53,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:32:53,826 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:32:53,826 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:32:53,840 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:32:53,841 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:32:53" (1/1) ... [2024-11-13 21:32:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:32:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:32:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:32:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:32:53,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:54,813 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 21:32:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-13 21:32:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-13 21:32:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:32:55,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:55,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-13 21:32:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-13 21:32:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 21:32:56,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:57,068 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 21:32:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-13 21:32:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-13 21:32:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:32:57,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:32:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-11-13 21:32:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-11-13 21:32:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 21:32:58,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-11-13 21:32:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-11-13 21:32:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:32:58,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:32:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-11-13 21:32:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-11-13 21:32:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:32:59,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:33:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-11-13 21:33:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-11-13 21:33:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:33:00,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 349 states and 495 transitions. [2024-11-13 21:33:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 495 transitions. [2024-11-13 21:33:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:33:01,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-11-13 21:33:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-13 21:33:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:33:01,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:33:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-11-13 21:33:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-13 21:33:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 21:33:01,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-11-13 21:33:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-11-13 21:33:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 21:33:02,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 382 states and 537 transitions. [2024-11-13 21:33:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 537 transitions. [2024-11-13 21:33:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 21:33:03,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-11-13 21:33:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-11-13 21:33:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 21:33:03,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-13 21:33:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-13 21:33:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 21:33:03,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-11-13 21:33:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-11-13 21:33:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:33:04,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-11-13 21:33:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-11-13 21:33:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:33:04,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-11-13 21:33:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-11-13 21:33:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:33:05,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-11-13 21:33:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-11-13 21:33:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:33:05,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 413 states and 574 transitions. [2024-11-13 21:33:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 574 transitions. [2024-11-13 21:33:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:33:06,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-11-13 21:33:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-11-13 21:33:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:33:06,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-11-13 21:33:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-11-13 21:33:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:33:07,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:33:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-11-13 21:33:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-11-13 21:33:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 21:33:07,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:33:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 478 states and 645 transitions. [2024-11-13 21:33:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 645 transitions. [2024-11-13 21:33:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 21:33:09,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:33:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-11-13 21:33:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-11-13 21:33:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:33:10,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:10,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-11-13 21:33:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-11-13 21:33:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:33:10,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:33:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-11-13 21:33:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-11-13 21:33:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 21:33:11,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:33:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-11-13 21:33:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-11-13 21:33:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 21:33:11,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 609 states and 789 transitions. [2024-11-13 21:33:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 789 transitions. [2024-11-13 21:33:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 21:33:12,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 619 states and 800 transitions. [2024-11-13 21:33:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 800 transitions. [2024-11-13 21:33:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 21:33:13,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 21:33:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 634 states and 818 transitions. [2024-11-13 21:33:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 818 transitions. [2024-11-13 21:33:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 21:33:14,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 21:33:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 648 states and 834 transitions. [2024-11-13 21:33:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 834 transitions. [2024-11-13 21:33:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 21:33:15,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:15,663 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 21:33:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 687 states and 877 transitions. [2024-11-13 21:33:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 877 transitions. [2024-11-13 21:33:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:33:15,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:15,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:16,319 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 21:33:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 757 states and 955 transitions. [2024-11-13 21:33:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 955 transitions. [2024-11-13 21:33:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:33:17,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:18,090 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 21:33:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 826 states and 1044 transitions. [2024-11-13 21:33:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1044 transitions. [2024-11-13 21:33:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:33:20,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:20,489 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 21:33:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 894 states and 1116 transitions. [2024-11-13 21:33:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1116 transitions. [2024-11-13 21:33:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:33:22,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 21:33:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 895 states and 1116 transitions. [2024-11-13 21:33:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1116 transitions. [2024-11-13 21:33:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 21:33:22,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 923 states and 1146 transitions. [2024-11-13 21:33:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1146 transitions. [2024-11-13 21:33:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 21:33:23,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 963 states and 1195 transitions. [2024-11-13 21:33:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1195 transitions. [2024-11-13 21:33:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 21:33:25,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1002 states and 1237 transitions. [2024-11-13 21:33:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1237 transitions. [2024-11-13 21:33:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 21:33:27,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1073 states and 1308 transitions. [2024-11-13 21:33:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1308 transitions. [2024-11-13 21:33:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 21:33:28,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1092 states and 1329 transitions. [2024-11-13 21:33:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1329 transitions. [2024-11-13 21:33:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 21:33:29,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1111 states and 1351 transitions. [2024-11-13 21:33:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1351 transitions. [2024-11-13 21:33:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:33:30,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 21:33:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1126 states and 1368 transitions. [2024-11-13 21:33:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1368 transitions. [2024-11-13 21:33:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:33:32,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 21:33:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1141 states and 1385 transitions. [2024-11-13 21:33:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1385 transitions. [2024-11-13 21:33:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 21:33:32,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1160 states and 1406 transitions. [2024-11-13 21:33:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1406 transitions. [2024-11-13 21:33:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 21:33:34,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1179 states and 1427 transitions. [2024-11-13 21:33:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1427 transitions. [2024-11-13 21:33:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 21:33:35,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 21:33:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1196 states and 1448 transitions. [2024-11-13 21:33:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1448 transitions. [2024-11-13 21:33:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 21:33:36,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:33:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1212 states and 1468 transitions. [2024-11-13 21:33:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1468 transitions. [2024-11-13 21:33:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 21:33:36,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1217 states and 1474 transitions. [2024-11-13 21:33:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1474 transitions. [2024-11-13 21:33:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 21:33:37,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:33:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1227 states and 1485 transitions. [2024-11-13 21:33:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1485 transitions. [2024-11-13 21:33:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 21:33:38,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:33:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1248 states and 1511 transitions. [2024-11-13 21:33:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1511 transitions. [2024-11-13 21:33:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 21:33:38,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:33:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1289 states and 1556 transitions. [2024-11-13 21:33:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1556 transitions. [2024-11-13 21:33:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 21:33:40,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:33:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1327 states and 1597 transitions. [2024-11-13 21:33:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1597 transitions. [2024-11-13 21:33:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:33:41,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1338 states and 1615 transitions. [2024-11-13 21:33:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1615 transitions. [2024-11-13 21:33:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:33:43,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1370 states and 1649 transitions. [2024-11-13 21:33:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1649 transitions. [2024-11-13 21:33:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:33:44,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1374 states and 1654 transitions. [2024-11-13 21:33:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1654 transitions. [2024-11-13 21:33:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:33:45,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1393 states and 1675 transitions. [2024-11-13 21:33:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1675 transitions. [2024-11-13 21:33:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:33:46,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:33:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1409 states and 1692 transitions. [2024-11-13 21:33:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1692 transitions. [2024-11-13 21:33:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:33:47,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:33:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1410 states and 1695 transitions. [2024-11-13 21:33:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1695 transitions. [2024-11-13 21:33:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 21:33:47,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:33:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1413 states and 1698 transitions. [2024-11-13 21:33:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1698 transitions. [2024-11-13 21:33:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 21:33:48,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:33:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1416 states and 1701 transitions. [2024-11-13 21:33:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1701 transitions. [2024-11-13 21:33:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 21:33:48,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:33:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1441 states and 1727 transitions. [2024-11-13 21:33:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1727 transitions. [2024-11-13 21:33:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 21:33:49,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:33:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1465 states and 1751 transitions. [2024-11-13 21:33:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1751 transitions. [2024-11-13 21:33:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:33:49,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:49,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:50,459 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 21:33:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1496 states and 1794 transitions. [2024-11-13 21:33:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1794 transitions. [2024-11-13 21:33:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:33:52,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:52,952 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 21:33:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1554 states and 1858 transitions. [2024-11-13 21:33:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1858 transitions. [2024-11-13 21:33:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:33:55,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:56,250 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 21:33:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1558 states and 1863 transitions. [2024-11-13 21:33:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1863 transitions. [2024-11-13 21:33:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:33:57,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:57,687 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 21:33:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1560 states and 1865 transitions. [2024-11-13 21:33:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1865 transitions. [2024-11-13 21:33:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:33:58,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:58,435 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 21:33:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1562 states and 1867 transitions. [2024-11-13 21:33:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1867 transitions. [2024-11-13 21:33:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 21:33:58,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 21:34:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1594 states and 1904 transitions. [2024-11-13 21:34:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1904 transitions. [2024-11-13 21:34:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 21:34:00,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 21:34:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1595 states and 1905 transitions. [2024-11-13 21:34:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1905 transitions. [2024-11-13 21:34:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 21:34:00,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:34:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1596 states and 1906 transitions. [2024-11-13 21:34:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1906 transitions. [2024-11-13 21:34:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 21:34:01,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:34:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1625 states and 1939 transitions. [2024-11-13 21:34:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1939 transitions. [2024-11-13 21:34:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:01,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:34:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1644 states and 1957 transitions. [2024-11-13 21:34:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1957 transitions. [2024-11-13 21:34:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:03,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:34:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1663 states and 1975 transitions. [2024-11-13 21:34:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1975 transitions. [2024-11-13 21:34:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:04,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:34:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1672 states and 1984 transitions. [2024-11-13 21:34:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1984 transitions. [2024-11-13 21:34:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:05,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 1702 states and 2018 transitions. [2024-11-13 21:34:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2018 transitions. [2024-11-13 21:34:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:08,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 1724 states and 2041 transitions. [2024-11-13 21:34:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2041 transitions. [2024-11-13 21:34:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:34:09,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1740 states and 2057 transitions. [2024-11-13 21:34:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2057 transitions. [2024-11-13 21:34:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 21:34:10,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 21:34:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 1755 states and 2073 transitions. [2024-11-13 21:34:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2073 transitions. [2024-11-13 21:34:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:34:12,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:34:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1762 states and 2080 transitions. [2024-11-13 21:34:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2080 transitions. [2024-11-13 21:34:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:34:13,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:34:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1804 states and 2125 transitions. [2024-11-13 21:34:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2125 transitions. [2024-11-13 21:34:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:34:15,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:15,767 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 21:34:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1854 states and 2181 transitions. [2024-11-13 21:34:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2181 transitions. [2024-11-13 21:34:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:34:18,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:19,101 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 21:34:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1889 states and 2219 transitions. [2024-11-13 21:34:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2219 transitions. [2024-11-13 21:34:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:21,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:34:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1892 states and 2223 transitions. [2024-11-13 21:34:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2223 transitions. [2024-11-13 21:34:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:22,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1947 states and 2284 transitions. [2024-11-13 21:34:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2284 transitions. [2024-11-13 21:34:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:34:26,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1961 states and 2300 transitions. [2024-11-13 21:34:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2300 transitions. [2024-11-13 21:34:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:34:28,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1974 states and 2316 transitions. [2024-11-13 21:34:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2316 transitions. [2024-11-13 21:34:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:34:30,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 1981 states and 2322 transitions. [2024-11-13 21:34:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2322 transitions. [2024-11-13 21:34:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:32,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:33,114 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 21:34:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2045 states and 2394 transitions. [2024-11-13 21:34:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2394 transitions. [2024-11-13 21:34:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:34:37,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:37,549 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 21:34:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2108 states and 2460 transitions. [2024-11-13 21:34:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2460 transitions. [2024-11-13 21:34:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:34:42,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2242 states and 2615 transitions. [2024-11-13 21:34:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2615 transitions. [2024-11-13 21:34:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:34:49,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:34:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2248 states and 2622 transitions. [2024-11-13 21:34:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2622 transitions. [2024-11-13 21:34:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:34:50,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:50,906 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 21:34:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2250 states and 2623 transitions. [2024-11-13 21:34:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2623 transitions. [2024-11-13 21:34:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 21:34:51,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:34:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2374 states and 2761 transitions. [2024-11-13 21:34:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2761 transitions. [2024-11-13 21:34:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:34:56,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2383 states and 2770 transitions. [2024-11-13 21:34:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2770 transitions. [2024-11-13 21:34:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:34:57,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:34:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2392 states and 2779 transitions. [2024-11-13 21:34:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2779 transitions. [2024-11-13 21:34:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 21:34:58,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 21:34:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2397 states and 2785 transitions. [2024-11-13 21:34:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2785 transitions. [2024-11-13 21:34:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 21:34:59,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:35:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2399 states and 2787 transitions. [2024-11-13 21:35:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2787 transitions. [2024-11-13 21:35:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 21:35:00,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:35:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2401 states and 2789 transitions. [2024-11-13 21:35:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2789 transitions. [2024-11-13 21:35:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 21:35:01,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 21:35:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2402 states and 2790 transitions. [2024-11-13 21:35:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2790 transitions. [2024-11-13 21:35:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:35:01,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 21:35:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2403 states and 2791 transitions. [2024-11-13 21:35:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2791 transitions. [2024-11-13 21:35:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:35:02,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 21:35:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2414 states and 2806 transitions. [2024-11-13 21:35:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2806 transitions. [2024-11-13 21:35:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:35:02,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:35:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2430 states and 2824 transitions. [2024-11-13 21:35:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2824 transitions. [2024-11-13 21:35:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-13 21:35:05,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2455 states and 2853 transitions. [2024-11-13 21:35:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 2853 transitions. [2024-11-13 21:35:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:35:07,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 21:35:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2457 states and 2855 transitions. [2024-11-13 21:35:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 2855 transitions. [2024-11-13 21:35:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-13 21:35:08,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:35:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2462 states and 2861 transitions. [2024-11-13 21:35:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2861 transitions. [2024-11-13 21:35:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-13 21:35:09,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:35:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2467 states and 2867 transitions. [2024-11-13 21:35:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2867 transitions. [2024-11-13 21:35:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-13 21:35:10,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:35:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2473 states and 2876 transitions. [2024-11-13 21:35:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 2876 transitions. [2024-11-13 21:35:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-13 21:35:13,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:35:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2479 states and 2885 transitions. [2024-11-13 21:35:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 2885 transitions. [2024-11-13 21:35:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:35:14,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2482 states and 2893 transitions. [2024-11-13 21:35:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2893 transitions. [2024-11-13 21:35:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:35:16,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2485 states and 2899 transitions. [2024-11-13 21:35:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 2899 transitions. [2024-11-13 21:35:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 21:35:17,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2490 states and 2905 transitions. [2024-11-13 21:35:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 2905 transitions. [2024-11-13 21:35:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:35:18,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2497 states and 2911 transitions. [2024-11-13 21:35:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 2911 transitions. [2024-11-13 21:35:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:35:20,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:20,305 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 21:35:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2511 states and 2927 transitions. [2024-11-13 21:35:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 2927 transitions. [2024-11-13 21:35:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:35:20,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:35:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2550 states and 2971 transitions. [2024-11-13 21:35:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 2971 transitions. [2024-11-13 21:35:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:35:23,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:35:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2565 states and 2993 transitions. [2024-11-13 21:35:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 2993 transitions. [2024-11-13 21:35:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:35:26,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:35:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2580 states and 3015 transitions. [2024-11-13 21:35:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3015 transitions. [2024-11-13 21:35:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:35:29,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 132 proven. 166 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 21:35:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2670 states and 3108 transitions. [2024-11-13 21:35:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3108 transitions. [2024-11-13 21:35:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:31,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:31,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:32,377 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 21:35:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 2760 states and 3210 transitions. [2024-11-13 21:35:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3210 transitions. [2024-11-13 21:35:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:35:41,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:41,700 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 21:35:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 2828 states and 3284 transitions. [2024-11-13 21:35:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3284 transitions. [2024-11-13 21:35:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:35:48,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:35:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 2831 states and 3287 transitions. [2024-11-13 21:35:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3287 transitions. [2024-11-13 21:35:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:35:49,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 21:35:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 2832 states and 3288 transitions. [2024-11-13 21:35:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3288 transitions. [2024-11-13 21:35:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:50,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:51,159 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 21:35:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 2878 states and 3344 transitions. [2024-11-13 21:35:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3344 transitions. [2024-11-13 21:35:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:55,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:55,402 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 21:35:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 2888 states and 3357 transitions. [2024-11-13 21:35:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3357 transitions. [2024-11-13 21:35:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:35:57,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:57,553 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 21:36:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 2909 states and 3378 transitions. [2024-11-13 21:36:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3378 transitions. [2024-11-13 21:36:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:36:01,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:01,501 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 21:36:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 2932 states and 3402 transitions. [2024-11-13 21:36:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3402 transitions. [2024-11-13 21:36:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:04,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 2957 states and 3430 transitions. [2024-11-13 21:36:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3430 transitions. [2024-11-13 21:36:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:07,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:08,216 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 21:36:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3046 states and 3528 transitions. [2024-11-13 21:36:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3528 transitions. [2024-11-13 21:36:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:18,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:18,783 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 21:36:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3078 states and 3562 transitions. [2024-11-13 21:36:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 3562 transitions. [2024-11-13 21:36:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:24,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:25,120 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 21:36:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3082 states and 3566 transitions. [2024-11-13 21:36:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3566 transitions. [2024-11-13 21:36:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:36:26,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:26,510 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 21:36:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3101 states and 3586 transitions. [2024-11-13 21:36:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 3586 transitions. [2024-11-13 21:36:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:36:29,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:36:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3103 states and 3588 transitions. [2024-11-13 21:36:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 3588 transitions. [2024-11-13 21:36:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:36:30,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:30,538 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 21:36:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3134 states and 3621 transitions. [2024-11-13 21:36:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3621 transitions. [2024-11-13 21:36:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:36:34,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:35,329 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 21:36:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3261 states and 3760 transitions. [2024-11-13 21:36:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 3760 transitions. [2024-11-13 21:36:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:36:43,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:44,191 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 21:36:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3322 states and 3833 transitions. [2024-11-13 21:36:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 3833 transitions. [2024-11-13 21:36:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:36:47,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 21:36:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3324 states and 3836 transitions. [2024-11-13 21:36:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 3836 transitions. [2024-11-13 21:36:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:36:48,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 21:36:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3328 states and 3840 transitions. [2024-11-13 21:36:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 3840 transitions. [2024-11-13 21:36:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:36:48,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 21:36:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3331 states and 3843 transitions. [2024-11-13 21:36:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3843 transitions. [2024-11-13 21:36:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 21:36:49,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:50,601 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 21:36:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3465 states and 3986 transitions. [2024-11-13 21:36:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 3986 transitions. [2024-11-13 21:36:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-13 21:36:54,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:36:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:36:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 3550 states and 4078 transitions. [2024-11-13 21:36:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4078 transitions. [2024-11-13 21:36:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-13 21:36:59,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:36:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:36:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:36:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:37:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 3572 states and 4105 transitions. [2024-11-13 21:37:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4105 transitions. [2024-11-13 21:37:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-13 21:37:02,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 179 proven. 204 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-13 21:37:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 3576 states and 4108 transitions. [2024-11-13 21:37:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 4108 transitions. [2024-11-13 21:37:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-13 21:37:03,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 238 proven. 242 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-13 21:37:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 3592 states and 4124 transitions. [2024-11-13 21:37:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4124 transitions. [2024-11-13 21:37:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-13 21:37:04,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:37:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:37:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:37:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 201 proven. 238 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-13 21:37:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:37:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3295 states and 3804 transitions. [2024-11-13 21:37:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 3804 transitions. [2024-11-13 21:37:05,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:37:05,135 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 145 iterations. [2024-11-13 21:37:05,148 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:37:30,206 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,208 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,208 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,211 INFO L77 FloydHoareUtils]: At program point L467-1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a20~0 1))) (and (not (and .cse0 (= 5 ~a16~0) .cse1 .cse2 (= ~a8~0 15))) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse1 .cse2 (= ~a16~0 4))) (= ~a7~0 1)))) [2024-11-13 21:37:30,211 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,211 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,211 INFO L75 FloydHoareUtils]: For program point L468(line 468) no Hoare annotation was computed. [2024-11-13 21:37:30,211 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,212 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,213 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,213 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,213 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,213 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,213 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,215 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,215 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,215 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,216 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,216 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,216 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,216 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,216 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,217 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,217 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,217 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,217 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,217 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,220 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,220 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,220 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,220 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,221 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,221 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,221 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,221 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,221 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,222 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,222 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,222 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,222 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,222 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,223 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:37:30,224 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,225 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,225 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,225 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,225 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,225 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,226 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,226 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,226 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 468) no Hoare annotation was computed. [2024-11-13 21:37:30,226 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,228 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,228 INFO L77 FloydHoareUtils]: At program point L464-1(lines 40 585) the Hoare annotation is: (or (not (= ~a21~0 1)) (not (= ~a7~0 1)) (and (= ~a12~0 8) (= ~a8~0 13) (= ~a17~0 1) (= ~a20~0 1) (= ~a16~0 4))) [2024-11-13 21:37:30,228 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,228 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,229 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,229 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-13 21:37:30,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:37:30 ImpRootNode [2024-11-13 21:37:30,255 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:37:30,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:37:30,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:37:30,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:37:30,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:32:53" (3/4) ... [2024-11-13 21:37:30,259 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:37:30,278 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-13 21:37:30,283 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 21:37:30,284 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 21:37:30,285 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:37:30,452 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:37:30,453 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:37:30,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:37:30,455 INFO L158 Benchmark]: Toolchain (without parser) took 279514.14ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 116.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 590.5MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,455 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:37:30,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.67ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 89.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.67ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,456 INFO L158 Benchmark]: Boogie Preprocessor took 59.56ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:37:30,457 INFO L158 Benchmark]: RCFGBuilder took 2121.61ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 71.5MB in the end (delta: 8.7MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,457 INFO L158 Benchmark]: CodeCheck took 276429.19ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 71.5MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,458 INFO L158 Benchmark]: Witness Printer took 198.32ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:37:30,460 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: 251.3s, OverallIterations: 145, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503737 SdHoareTripleChecker+Valid, 1617.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501596 mSDsluCounter, 76069 SdHoareTripleChecker+Invalid, 1379.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64847 mSDsCounter, 142786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1115397 IncrementalHoareTripleChecker+Invalid, 1258183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142786 mSolverCounterUnsat, 11222 mSDtfsCounter, 1115397 mSolverCounterSat, 16.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182701 GetRequests, 174348 SyntacticMatches, 7121 SemanticMatches, 1232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158702 ImplicationChecksByTransitivity, 180.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 27248 NumberOfCodeBlocks, 27248 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 27104 ConstructedInterpolants, 0 QuantifiedInterpolants, 175892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 144 InterpolantComputations, 43 PerfectInterpolantSequences, 24255/31000 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: 468]: 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: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.67ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 89.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.67ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.56ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2121.61ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 71.5MB in the end (delta: 8.7MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * CodeCheck took 276429.19ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 71.5MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB. * Witness Printer took 198.32ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:37:30,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e701f861-a426-40dc-ae18-83b183c82edf/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