./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.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_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/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_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/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_36dc111c-06b2-4843-9403-22c7b85df3a1/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 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:54:17,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:54:17,744 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:54:17,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:54:17,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:54:17,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:54:17,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:54:17,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:54:17,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:54:17,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:54:17,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:54:17,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:54:17,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:54:17,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:54:17,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:54:17,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:54:17,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:54:17,781 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:54:17,781 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:54:17,781 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:54:17,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:54:17,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:54:17,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:54:17,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:54:17,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:54:17,782 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:54:17,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:54:17,782 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_36dc111c-06b2-4843-9403-22c7b85df3a1/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 -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2024-11-13 21:54:18,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:54:18,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:54:18,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:54:18,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:54:18,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:54:18,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c Unable to find full path for "g++" [2024-11-13 21:54:20,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:54:20,483 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:54:20,484 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-13 21:54:20,500 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/data/311ed0554/5da3ebec3a3740b6b7f04470601daa02/FLAGe8aa825e8 [2024-11-13 21:54:20,533 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/data/311ed0554/5da3ebec3a3740b6b7f04470601daa02 [2024-11-13 21:54:20,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:54:20,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:54:20,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:54:20,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:54:20,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:54:20,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:54:20" (1/1) ... [2024-11-13 21:54:20,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e6825e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:20, skipping insertion in model container [2024-11-13 21:54:20,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:54:20" (1/1) ... [2024-11-13 21:54:20,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:54:20,927 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_36dc111c-06b2-4843-9403-22c7b85df3a1/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-13 21:54:20,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:54:20,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:54:21,094 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_36dc111c-06b2-4843-9403-22c7b85df3a1/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-13 21:54:21,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:54:21,128 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:54:21,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21 WrapperNode [2024-11-13 21:54:21,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:54:21,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:54:21,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:54:21,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:54:21,137 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:54:21" (1/1) ... [2024-11-13 21:54:21,151 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:54:21" (1/1) ... [2024-11-13 21:54:21,197 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:54:21,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:54:21,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:54:21,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:54:21,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:54:21,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:54:21,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:54:21,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:54:21,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:54:21,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:54:21" (1/1) ... [2024-11-13 21:54:21,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:54:21,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:54:21,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/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:54:21,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/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:54:21,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:54:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:54:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:54:21,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:54:21,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:54:21,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:54:22,788 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:54:22,788 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:54:23,126 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:54:23,128 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:54:23,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:54:23 BoogieIcfgContainer [2024-11-13 21:54:23,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:54:23,129 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:54:23,129 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:54:23,140 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:54:23,140 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:54:23" (1/1) ... [2024-11-13 21:54:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:54:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:54:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:54:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:54:23,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:23,917 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:54:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-13 21:54:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-13 21:54:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:54:24,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-13 21:54:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-13 21:54:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 21:54:25,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:25,367 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:54:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-13 21:54:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-13 21:54:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:54:25,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-13 21:54:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-13 21:54:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 21:54:27,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-13 21:54:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-13 21:54:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 21:54:27,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-13 21:54:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-13 21:54:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 21:54:27,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-13 21:54:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-13 21:54:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 21:54:28,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-13 21:54:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-13 21:54:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 21:54:28,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:28,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-13 21:54:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-13 21:54:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 21:54:29,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-13 21:54:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-13 21:54:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 21:54:30,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-13 21:54:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-13 21:54:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:54:30,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-13 21:54:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-13 21:54:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 21:54:31,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-13 21:54:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-13 21:54:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:54:31,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-13 21:54:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-13 21:54:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:54:32,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-13 21:54:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-13 21:54:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 21:54:32,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-13 21:54:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-13 21:54:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 21:54:33,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-13 21:54:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-13 21:54:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 21:54:33,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:54:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-13 21:54:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-13 21:54:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:54:34,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-13 21:54:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-13 21:54:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 21:54:34,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-13 21:54:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-13 21:54:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 21:54:35,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-13 21:54:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-13 21:54:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 21:54:35,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-13 21:54:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-13 21:54:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:54:36,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 363 states and 472 transitions. [2024-11-13 21:54:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2024-11-13 21:54:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:54:36,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 367 states and 477 transitions. [2024-11-13 21:54:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 477 transitions. [2024-11-13 21:54:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:54:37,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:54:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 381 states and 491 transitions. [2024-11-13 21:54:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-13 21:54:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:54:38,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 383 states and 495 transitions. [2024-11-13 21:54:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-11-13 21:54:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:54:38,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 402 states and 516 transitions. [2024-11-13 21:54:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 516 transitions. [2024-11-13 21:54:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 21:54:39,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 404 states and 518 transitions. [2024-11-13 21:54:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2024-11-13 21:54:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 21:54:39,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 418 states and 532 transitions. [2024-11-13 21:54:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 532 transitions. [2024-11-13 21:54:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 21:54:39,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 426 states and 543 transitions. [2024-11-13 21:54:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 543 transitions. [2024-11-13 21:54:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 21:54:39,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 466 states and 585 transitions. [2024-11-13 21:54:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 585 transitions. [2024-11-13 21:54:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 21:54:41,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:54:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 471 states and 590 transitions. [2024-11-13 21:54:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 590 transitions. [2024-11-13 21:54:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 21:54:41,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:54:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 476 states and 596 transitions. [2024-11-13 21:54:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 596 transitions. [2024-11-13 21:54:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:54:41,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:54:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 479 states and 600 transitions. [2024-11-13 21:54:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2024-11-13 21:54:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 21:54:42,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:54:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 481 states and 603 transitions. [2024-11-13 21:54:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2024-11-13 21:54:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 21:54:43,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:54:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 484 states and 606 transitions. [2024-11-13 21:54:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2024-11-13 21:54:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:54:43,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 534 states and 661 transitions. [2024-11-13 21:54:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 661 transitions. [2024-11-13 21:54:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:54:44,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 536 states and 662 transitions. [2024-11-13 21:54:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 662 transitions. [2024-11-13 21:54:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 21:54:44,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:54:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 539 states and 665 transitions. [2024-11-13 21:54:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2024-11-13 21:54:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 21:54:45,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:45,497 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:54:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 559 states and 686 transitions. [2024-11-13 21:54:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 686 transitions. [2024-11-13 21:54:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:54:45,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:46,155 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:54:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 699 states and 841 transitions. [2024-11-13 21:54:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 841 transitions. [2024-11-13 21:54:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:54:47,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:48,372 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:54:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 768 states and 926 transitions. [2024-11-13 21:54:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 926 transitions. [2024-11-13 21:54:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:54:49,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 822 states and 987 transitions. [2024-11-13 21:54:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 987 transitions. [2024-11-13 21:54:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:54:52,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 839 states and 1006 transitions. [2024-11-13 21:54:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1006 transitions. [2024-11-13 21:54:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:54:53,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 841 states and 1007 transitions. [2024-11-13 21:54:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1007 transitions. [2024-11-13 21:54:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:54:54,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 854 states and 1022 transitions. [2024-11-13 21:54:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1022 transitions. [2024-11-13 21:54:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 21:54:55,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:54:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 868 states and 1039 transitions. [2024-11-13 21:54:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1039 transitions. [2024-11-13 21:54:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 21:54:55,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:54:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 889 states and 1058 transitions. [2024-11-13 21:54:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1058 transitions. [2024-11-13 21:54:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 21:54:56,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 919 states and 1092 transitions. [2024-11-13 21:54:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1092 transitions. [2024-11-13 21:54:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 21:54:57,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:54:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 933 states and 1105 transitions. [2024-11-13 21:54:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1105 transitions. [2024-11-13 21:54:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 21:54:58,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 950 states and 1123 transitions. [2024-11-13 21:54:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1123 transitions. [2024-11-13 21:54:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:54:59,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:59,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:54:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 996 states and 1176 transitions. [2024-11-13 21:54:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1176 transitions. [2024-11-13 21:54:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:54:59,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:55:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 997 states and 1176 transitions. [2024-11-13 21:55:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1176 transitions. [2024-11-13 21:55:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 21:55:00,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1068 states and 1263 transitions. [2024-11-13 21:55:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1263 transitions. [2024-11-13 21:55:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 21:55:02,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1077 states and 1273 transitions. [2024-11-13 21:55:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1273 transitions. [2024-11-13 21:55:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 21:55:03,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1117 states and 1320 transitions. [2024-11-13 21:55:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1320 transitions. [2024-11-13 21:55:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 21:55:04,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:55:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1210 states and 1435 transitions. [2024-11-13 21:55:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1435 transitions. [2024-11-13 21:55:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 21:55:07,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:55:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1212 states and 1438 transitions. [2024-11-13 21:55:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1438 transitions. [2024-11-13 21:55:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 21:55:08,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:55:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1239 states and 1469 transitions. [2024-11-13 21:55:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1469 transitions. [2024-11-13 21:55:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-13 21:55:09,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:55:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1269 states and 1501 transitions. [2024-11-13 21:55:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1501 transitions. [2024-11-13 21:55:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 21:55:10,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:55:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1285 states and 1516 transitions. [2024-11-13 21:55:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1516 transitions. [2024-11-13 21:55:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 21:55:10,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:55:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1314 states and 1548 transitions. [2024-11-13 21:55:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1548 transitions. [2024-11-13 21:55:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:55:11,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:12,093 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:55:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1330 states and 1565 transitions. [2024-11-13 21:55:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1565 transitions. [2024-11-13 21:55:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:55:12,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:13,199 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:55:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1335 states and 1569 transitions. [2024-11-13 21:55:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1569 transitions. [2024-11-13 21:55:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 21:55:13,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:55:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1367 states and 1602 transitions. [2024-11-13 21:55:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1602 transitions. [2024-11-13 21:55:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 21:55:16,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1381 states and 1619 transitions. [2024-11-13 21:55:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1619 transitions. [2024-11-13 21:55:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:55:17,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:17,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 21:55:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1432 states and 1690 transitions. [2024-11-13 21:55:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1690 transitions. [2024-11-13 21:55:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:55:20,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 21:55:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1445 states and 1704 transitions. [2024-11-13 21:55:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1704 transitions. [2024-11-13 21:55:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:55:21,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:55:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1605 states and 1886 transitions. [2024-11-13 21:55:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1886 transitions. [2024-11-13 21:55:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 21:55:26,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:26,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1635 states and 1929 transitions. [2024-11-13 21:55:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1929 transitions. [2024-11-13 21:55:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 21:55:28,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1649 states and 1947 transitions. [2024-11-13 21:55:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1947 transitions. [2024-11-13 21:55:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:55:29,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:30,046 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:55:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1674 states and 1974 transitions. [2024-11-13 21:55:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1974 transitions. [2024-11-13 21:55:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:55:31,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:32,138 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:55:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1679 states and 1978 transitions. [2024-11-13 21:55:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1978 transitions. [2024-11-13 21:55:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:55:33,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:55:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1680 states and 1978 transitions. [2024-11-13 21:55:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 1978 transitions. [2024-11-13 21:55:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 21:55:33,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 1728 states and 2032 transitions. [2024-11-13 21:55:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2032 transitions. [2024-11-13 21:55:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:55:36,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:37,464 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:55:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 1780 states and 2099 transitions. [2024-11-13 21:55:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2099 transitions. [2024-11-13 21:55:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:55:39,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:55:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1818 states and 2138 transitions. [2024-11-13 21:55:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2138 transitions. [2024-11-13 21:55:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:55:40,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 21:55:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1824 states and 2145 transitions. [2024-11-13 21:55:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2145 transitions. [2024-11-13 21:55:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 21:55:41,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 21:55:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1833 states and 2157 transitions. [2024-11-13 21:55:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2157 transitions. [2024-11-13 21:55:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:55:42,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 21:55:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1877 states and 2208 transitions. [2024-11-13 21:55:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2208 transitions. [2024-11-13 21:55:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:55:44,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 21:55:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 1878 states and 2211 transitions. [2024-11-13 21:55:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2211 transitions. [2024-11-13 21:55:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:55:45,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:45,443 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:55:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1891 states and 2225 transitions. [2024-11-13 21:55:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2225 transitions. [2024-11-13 21:55:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 21:55:46,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 21:55:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1925 states and 2262 transitions. [2024-11-13 21:55:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2262 transitions. [2024-11-13 21:55:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 21:55:47,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 21:55:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1934 states and 2270 transitions. [2024-11-13 21:55:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2270 transitions. [2024-11-13 21:55:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 21:55:48,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:55:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2027 states and 2373 transitions. [2024-11-13 21:55:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2373 transitions. [2024-11-13 21:55:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 21:55:51,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:55:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2040 states and 2387 transitions. [2024-11-13 21:55:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2387 transitions. [2024-11-13 21:55:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 21:55:51,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 21:55:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2053 states and 2401 transitions. [2024-11-13 21:55:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2401 transitions. [2024-11-13 21:55:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:55:52,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:55:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2081 states and 2437 transitions. [2024-11-13 21:55:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2437 transitions. [2024-11-13 21:55:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:55:56,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:55:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2104 states and 2462 transitions. [2024-11-13 21:55:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2462 transitions. [2024-11-13 21:55:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:55:58,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 21:56:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2119 states and 2486 transitions. [2024-11-13 21:56:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2486 transitions. [2024-11-13 21:56:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:56:00,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 21:56:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2135 states and 2501 transitions. [2024-11-13 21:56:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2501 transitions. [2024-11-13 21:56:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:56:02,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 21:56:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2150 states and 2532 transitions. [2024-11-13 21:56:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2532 transitions. [2024-11-13 21:56:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:56:04,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 21:56:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2166 states and 2548 transitions. [2024-11-13 21:56:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2548 transitions. [2024-11-13 21:56:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:56:05,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 21:56:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2179 states and 2561 transitions. [2024-11-13 21:56:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2561 transitions. [2024-11-13 21:56:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 21:56:06,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 21:56:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2209 states and 2596 transitions. [2024-11-13 21:56:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2596 transitions. [2024-11-13 21:56:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 21:56:09,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 21:56:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2222 states and 2609 transitions. [2024-11-13 21:56:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2609 transitions. [2024-11-13 21:56:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 21:56:09,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 178 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:56:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2306 states and 2709 transitions. [2024-11-13 21:56:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2709 transitions. [2024-11-13 21:56:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 21:56:13,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:56:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2318 states and 2721 transitions. [2024-11-13 21:56:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2721 transitions. [2024-11-13 21:56:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:56:15,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 21:56:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2353 states and 2763 transitions. [2024-11-13 21:56:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2763 transitions. [2024-11-13 21:56:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:56:17,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:56:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2367 states and 2782 transitions. [2024-11-13 21:56:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2782 transitions. [2024-11-13 21:56:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:56:18,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:56:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2393 states and 2808 transitions. [2024-11-13 21:56:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2808 transitions. [2024-11-13 21:56:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 21:56:20,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:56:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2406 states and 2822 transitions. [2024-11-13 21:56:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2822 transitions. [2024-11-13 21:56:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 21:56:20,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:56:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2431 states and 2846 transitions. [2024-11-13 21:56:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2846 transitions. [2024-11-13 21:56:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 21:56:21,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:56:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2539 states and 2968 transitions. [2024-11-13 21:56:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2968 transitions. [2024-11-13 21:56:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 21:56:24,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:56:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2578 states and 3018 transitions. [2024-11-13 21:56:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3018 transitions. [2024-11-13 21:56:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 21:56:28,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:56:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2602 states and 3043 transitions. [2024-11-13 21:56:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3043 transitions. [2024-11-13 21:56:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:56:30,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:56:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 2626 states and 3074 transitions. [2024-11-13 21:56:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3074 transitions. [2024-11-13 21:56:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:56:33,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:56:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 2632 states and 3083 transitions. [2024-11-13 21:56:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3083 transitions. [2024-11-13 21:56:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:56:35,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:35,743 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:56:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 2657 states and 3120 transitions. [2024-11-13 21:56:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3120 transitions. [2024-11-13 21:56:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:56:37,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:37,870 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:56:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 2658 states and 3124 transitions. [2024-11-13 21:56:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3124 transitions. [2024-11-13 21:56:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:38,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 21:56:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 2709 states and 3183 transitions. [2024-11-13 21:56:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3183 transitions. [2024-11-13 21:56:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:41,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 21:56:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 2745 states and 3222 transitions. [2024-11-13 21:56:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3222 transitions. [2024-11-13 21:56:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:44,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 2781 states and 3276 transitions. [2024-11-13 21:56:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3276 transitions. [2024-11-13 21:56:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:48,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 2795 states and 3294 transitions. [2024-11-13 21:56:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 3294 transitions. [2024-11-13 21:56:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:49,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 2821 states and 3323 transitions. [2024-11-13 21:56:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3323 transitions. [2024-11-13 21:56:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:51,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 2846 states and 3348 transitions. [2024-11-13 21:56:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3348 transitions. [2024-11-13 21:56:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:52,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 2859 states and 3362 transitions. [2024-11-13 21:56:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3362 transitions. [2024-11-13 21:56:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:53,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 2860 states and 3364 transitions. [2024-11-13 21:56:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3364 transitions. [2024-11-13 21:56:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:54,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 2860 states and 3363 transitions. [2024-11-13 21:56:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3363 transitions. [2024-11-13 21:56:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:56:55,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 21:56:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 2873 states and 3376 transitions. [2024-11-13 21:56:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3376 transitions. [2024-11-13 21:56:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:56:56,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 21:56:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 2875 states and 3382 transitions. [2024-11-13 21:56:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3382 transitions. [2024-11-13 21:56:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:56:57,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 21:56:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 2888 states and 3395 transitions. [2024-11-13 21:56:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3395 transitions. [2024-11-13 21:56:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:56:58,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 21:57:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 2926 states and 3432 transitions. [2024-11-13 21:57:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 3432 transitions. [2024-11-13 21:57:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:57:00,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 21:57:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 2952 states and 3464 transitions. [2024-11-13 21:57:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3464 transitions. [2024-11-13 21:57:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:57:02,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 21:57:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 2975 states and 3486 transitions. [2024-11-13 21:57:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3486 transitions. [2024-11-13 21:57:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:03,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:03,492 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:57:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3031 states and 3553 transitions. [2024-11-13 21:57:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3553 transitions. [2024-11-13 21:57:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:09,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:09,671 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:57:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3070 states and 3599 transitions. [2024-11-13 21:57:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3599 transitions. [2024-11-13 21:57:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:13,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:13,687 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:57:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3079 states and 3607 transitions. [2024-11-13 21:57:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3607 transitions. [2024-11-13 21:57:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:14,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:15,034 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:57:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3106 states and 3640 transitions. [2024-11-13 21:57:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3640 transitions. [2024-11-13 21:57:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:18,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:57:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3129 states and 3665 transitions. [2024-11-13 21:57:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3665 transitions. [2024-11-13 21:57:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:57:22,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:57:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3140 states and 3675 transitions. [2024-11-13 21:57:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 3675 transitions. [2024-11-13 21:57:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:57:23,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:57:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3175 states and 3717 transitions. [2024-11-13 21:57:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3717 transitions. [2024-11-13 21:57:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:57:30,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 172 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3211 states and 3754 transitions. [2024-11-13 21:57:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 3754 transitions. [2024-11-13 21:57:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:57:34,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:34,956 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:57:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3269 states and 3820 transitions. [2024-11-13 21:57:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 3820 transitions. [2024-11-13 21:57:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 21:57:37,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:57:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3275 states and 3827 transitions. [2024-11-13 21:57:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3827 transitions. [2024-11-13 21:57:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:57:38,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 21:57:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3291 states and 3844 transitions. [2024-11-13 21:57:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3844 transitions. [2024-11-13 21:57:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:57:39,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 21:57:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3311 states and 3866 transitions. [2024-11-13 21:57:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 3866 transitions. [2024-11-13 21:57:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 21:57:41,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-13 21:57:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3327 states and 3882 transitions. [2024-11-13 21:57:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 3882 transitions. [2024-11-13 21:57:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 21:57:42,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 21:57:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3356 states and 3912 transitions. [2024-11-13 21:57:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 3912 transitions. [2024-11-13 21:57:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:57:43,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:57:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3365 states and 3923 transitions. [2024-11-13 21:57:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 3923 transitions. [2024-11-13 21:57:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 21:57:45,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 21:57:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3377 states and 3935 transitions. [2024-11-13 21:57:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 3935 transitions. [2024-11-13 21:57:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:57:47,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 21:57:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3391 states and 3951 transitions. [2024-11-13 21:57:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 3951 transitions. [2024-11-13 21:57:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:57:48,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:48,961 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:57:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3412 states and 3974 transitions. [2024-11-13 21:57:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 3974 transitions. [2024-11-13 21:57:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:57:50,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 21:57:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3432 states and 3992 transitions. [2024-11-13 21:57:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 3992 transitions. [2024-11-13 21:57:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:57:53,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:57:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3435 states and 3996 transitions. [2024-11-13 21:57:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 3996 transitions. [2024-11-13 21:57:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:57:53,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:54,644 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:58:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 3565 states and 4141 transitions. [2024-11-13 21:58:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4141 transitions. [2024-11-13 21:58:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 21:58:01,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 188 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:58:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 3592 states and 4169 transitions. [2024-11-13 21:58:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4169 transitions. [2024-11-13 21:58:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-13 21:58:05,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:58:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 3619 states and 4202 transitions. [2024-11-13 21:58:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 4202 transitions. [2024-11-13 21:58:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-13 21:58:07,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 21:58:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 3728 states and 4325 transitions. [2024-11-13 21:58:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 4325 transitions. [2024-11-13 21:58:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:58:14,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:16,153 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:58:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 3777 states and 4389 transitions. [2024-11-13 21:58:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 4389 transitions. [2024-11-13 21:58:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:58:21,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:21,533 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:58:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 3778 states and 4389 transitions. [2024-11-13 21:58:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4389 transitions. [2024-11-13 21:58:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:58:22,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:58:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 3874 states and 4494 transitions. [2024-11-13 21:58:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 4494 transitions. [2024-11-13 21:58:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-13 21:58:27,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 369 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 21:58:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 3892 states and 4516 transitions. [2024-11-13 21:58:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 4516 transitions. [2024-11-13 21:58:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-13 21:58:32,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 21:58:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 3897 states and 4524 transitions. [2024-11-13 21:58:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 4524 transitions. [2024-11-13 21:58:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 21:58:33,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:34,922 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:58:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 3952 states and 4591 transitions. [2024-11-13 21:58:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4591 transitions. [2024-11-13 21:58:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:58:43,934 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 156 iterations. [2024-11-13 21:58:43,943 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:59:34,928 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,929 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,930 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,930 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,931 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,931 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,931 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,932 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,932 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,932 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,932 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,933 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,933 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,933 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,933 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,933 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,934 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,934 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,934 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,934 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,935 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,935 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,935 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,935 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,935 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,936 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,936 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,936 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse3 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse10 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse12 (= 14 ~a8~0)) (.cse9 (= ~a8~0 15)) (.cse11 (not .cse3)) (.cse2 (not (= ~a17~0 1))) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a8~0 13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse0)) (and .cse6 .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not (and .cse0 .cse9 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse10) (and .cse11 .cse10) (and (<= ~a16~0 4) .cse10) (and (not (and .cse6 (<= ~a16~0 5))) .cse10) (and .cse6 .cse0 .cse12 .cse1 .cse2 .cse3) (and (not .cse12) (not .cse5) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse9) (and .cse11 .cse5) (and .cse2 .cse5) (and (not .cse1) .cse5)))) [2024-11-13 21:59:34,936 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,937 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,937 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,937 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,937 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L482-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,938 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,939 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,939 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-13 21:59:34,939 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,939 INFO L75 FloydHoareUtils]: For program point L486(line 486) no Hoare annotation was computed. [2024-11-13 21:59:34,939 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,940 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,940 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,940 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse3 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse10 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse12 (= 14 ~a8~0)) (.cse9 (= ~a8~0 15)) (.cse11 (not .cse3)) (.cse2 (not (= ~a17~0 1))) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a8~0 13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse0)) (and .cse6 .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not (and .cse0 .cse9 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse10) (and .cse11 .cse10) (and (<= ~a16~0 4) .cse10) (and (not (and .cse6 (<= ~a16~0 5))) .cse10) (and .cse6 .cse0 .cse12 .cse1 .cse2 .cse3) (and (not .cse12) (not .cse5) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse9) (and .cse11 .cse5) (and .cse2 .cse5) (and (not .cse1) .cse5)))) [2024-11-13 21:59:34,940 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,940 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,941 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,942 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse10 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse12 (= 14 ~a8~0)) (.cse9 (= ~a8~0 15)) (.cse11 (not .cse3)) (.cse2 (not (= ~a17~0 1))) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a8~0 13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse0)) (and .cse6 .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not (and .cse0 .cse9 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse10) (and .cse11 .cse10) (and (<= ~a16~0 4) .cse10) (and (not (and .cse6 (<= ~a16~0 5))) .cse10) (and .cse6 .cse0 .cse12 .cse1 .cse2 .cse3) (and (not .cse12) (not .cse5) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse9) (and .cse11 .cse5) (and .cse2 .cse5) (and (not .cse1) .cse5)))) [2024-11-13 21:59:34,942 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,944 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,944 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,944 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:59:34,944 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,944 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,945 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse6 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse3 (not (= ~a17~0 1))) (.cse2 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not .cse1)) (and .cse6 .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse1 (not .cse5) .cse4 .cse8 .cse7) (and (not .cse4) .cse0) (and .cse3 .cse0) (and (not .cse2) .cse0)))) [2024-11-13 21:59:34,945 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 486) no Hoare annotation was computed. [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 21:59:34,946 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (not .cse9) (< ~a8~0 15)) (and (not (and .cse1 .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse8 .cse10)))) [2024-11-13 21:59:34,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:59:34 ImpRootNode [2024-11-13 21:59:34,961 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:59:34,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:59:34,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:59:34,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:59:34,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:54:23" (3/4) ... [2024-11-13 21:59:34,965 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:59:34,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-13 21:59:34,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 21:59:34,993 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 21:59:34,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:59:35,145 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:59:35,145 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:59:35,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:59:35,147 INFO L158 Benchmark]: Toolchain (without parser) took 314610.22ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 90.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 807.4MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,148 INFO L158 Benchmark]: CDTParser took 1.59ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:59:35,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.10ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.00ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 58.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,150 INFO L158 Benchmark]: Boogie Preprocessor took 48.64ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:59:35,151 INFO L158 Benchmark]: RCFGBuilder took 1880.95ms. Allocated memory is still 117.4MB. Free memory was 54.8MB in the beginning and 69.9MB in the end (delta: -15.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,151 INFO L158 Benchmark]: CodeCheck took 311831.97ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 69.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 779.3MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,152 INFO L158 Benchmark]: Witness Printer took 184.00ms. Allocated memory is still 3.0GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:59:35,154 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: 260.8s, OverallIterations: 156, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580065 SdHoareTripleChecker+Valid, 1497.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577576 mSDsluCounter, 80696 SdHoareTripleChecker+Invalid, 1287.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68870 mSDsCounter, 99585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1215122 IncrementalHoareTripleChecker+Invalid, 1314707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99585 mSolverCounterUnsat, 11826 mSDtfsCounter, 1215122 mSolverCounterSat, 12.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200232 GetRequests, 191423 SyntacticMatches, 7381 SemanticMatches, 1428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300325 ImplicationChecksByTransitivity, 190.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 29868 NumberOfCodeBlocks, 29868 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 29713 ConstructedInterpolants, 0 QuantifiedInterpolants, 162029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 155 InterpolantComputations, 74 PerfectInterpolantSequences, 28874/34560 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: 486]: 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: (((((((((((14 != a8) && (a8 != 13)) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((a17 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((14 != a8) && (a8 != 13)) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((a17 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.10ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.00ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 58.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.64ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1880.95ms. Allocated memory is still 117.4MB. Free memory was 54.8MB in the beginning and 69.9MB in the end (delta: -15.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * CodeCheck took 311831.97ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 69.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 779.3MB. Max. memory is 16.1GB. * Witness Printer took 184.00ms. Allocated memory is still 3.0GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:59:35,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36dc111c-06b2-4843-9403-22c7b85df3a1/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE