./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 05:03:22,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 05:03:23,011 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 05:03:23,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 05:03:23,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 05:03:23,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 05:03:23,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 05:03:23,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 05:03:23,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 05:03:23,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 05:03:23,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 05:03:23,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 05:03:23,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 05:03:23,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 05:03:23,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 05:03:23,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 05:03:23,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 05:03:23,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 05:03:23,069 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 05:03:23,069 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 05:03:23,070 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 05:03:23,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 05:03:23,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:03:23,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 05:03:23,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 05:03:23,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 05:03:23,071 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 05:03:23,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 05:03:23,071 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_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 [2024-11-25 05:03:23,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 05:03:23,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 05:03:23,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 05:03:23,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 05:03:23,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 05:03:23,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label57.c [2024-11-25 05:03:26,741 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/data/92593edd6/a5e38e7cd6df4ec6b918e99bc9d30eef/FLAGd05c43736 [2024-11-25 05:03:27,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 05:03:27,186 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/sv-benchmarks/c/eca-rers2012/Problem02_label57.c [2024-11-25 05:03:27,211 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/data/92593edd6/a5e38e7cd6df4ec6b918e99bc9d30eef/FLAGd05c43736 [2024-11-25 05:03:27,314 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/data/92593edd6/a5e38e7cd6df4ec6b918e99bc9d30eef [2024-11-25 05:03:27,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 05:03:27,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 05:03:27,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 05:03:27,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 05:03:27,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 05:03:27,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:27,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370503bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27, skipping insertion in model container [2024-11-25 05:03:27,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:27,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 05:03:27,654 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_e8415266-0ef3-4d9a-b8a2-0b2839489689/sv-benchmarks/c/eca-rers2012/Problem02_label57.c[15764,15777] [2024-11-25 05:03:27,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:03:27,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 05:03:27,827 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_e8415266-0ef3-4d9a-b8a2-0b2839489689/sv-benchmarks/c/eca-rers2012/Problem02_label57.c[15764,15777] [2024-11-25 05:03:27,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:03:27,879 INFO L204 MainTranslator]: Completed translation [2024-11-25 05:03:27,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27 WrapperNode [2024-11-25 05:03:27,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 05:03:27,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 05:03:27,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 05:03:27,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 05:03:27,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:27,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,013 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 05:03:28,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 05:03:28,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 05:03:28,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 05:03:28,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 05:03:28,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 05:03:28,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 05:03:28,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 05:03:28,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 05:03:28,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:27" (1/1) ... [2024-11-25 05:03:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:03:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 05:03:28,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 05:03:28,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 05:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 05:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 05:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 05:03:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 05:03:28,295 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 05:03:28,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 05:03:29,960 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 05:03:29,960 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 05:03:30,502 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 05:03:30,503 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 05:03:30,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:30 BoogieIcfgContainer [2024-11-25 05:03:30,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 05:03:30,507 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 05:03:30,507 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 05:03:30,523 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 05:03:30,524 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:30" (1/1) ... [2024-11-25 05:03:30,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 05:03:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 05:03:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 05:03:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 05:03:30,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-25 05:03:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-25 05:03:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 05:03:32,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-25 05:03:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-25 05:03:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 05:03:33,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 05:03:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-11-25 05:03:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-11-25 05:03:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 05:03:33,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 184 states and 274 transitions. [2024-11-25 05:03:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2024-11-25 05:03:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 05:03:34,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 202 states and 296 transitions. [2024-11-25 05:03:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2024-11-25 05:03:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 05:03:34,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 220 states and 323 transitions. [2024-11-25 05:03:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2024-11-25 05:03:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 05:03:35,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 223 states and 327 transitions. [2024-11-25 05:03:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-11-25 05:03:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 05:03:36,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 05:03:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 227 states and 334 transitions. [2024-11-25 05:03:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2024-11-25 05:03:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 05:03:36,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 05:03:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 244 states and 351 transitions. [2024-11-25 05:03:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-11-25 05:03:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 05:03:37,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2024-11-25 05:03:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2024-11-25 05:03:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 05:03:38,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:03:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 268 states and 382 transitions. [2024-11-25 05:03:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 382 transitions. [2024-11-25 05:03:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 05:03:38,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 372 states and 496 transitions. [2024-11-25 05:03:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 496 transitions. [2024-11-25 05:03:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 05:03:41,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 388 states and 518 transitions. [2024-11-25 05:03:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 518 transitions. [2024-11-25 05:03:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 05:03:42,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 391 states and 521 transitions. [2024-11-25 05:03:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 521 transitions. [2024-11-25 05:03:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 05:03:42,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 415 states and 550 transitions. [2024-11-25 05:03:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 550 transitions. [2024-11-25 05:03:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 05:03:44,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 429 states and 563 transitions. [2024-11-25 05:03:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 563 transitions. [2024-11-25 05:03:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 05:03:44,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 454 states and 598 transitions. [2024-11-25 05:03:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 598 transitions. [2024-11-25 05:03:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 05:03:45,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 462 states and 607 transitions. [2024-11-25 05:03:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 607 transitions. [2024-11-25 05:03:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 05:03:46,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 494 states and 649 transitions. [2024-11-25 05:03:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 649 transitions. [2024-11-25 05:03:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 05:03:48,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 495 states and 653 transitions. [2024-11-25 05:03:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 653 transitions. [2024-11-25 05:03:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 05:03:48,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 524 states and 696 transitions. [2024-11-25 05:03:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 696 transitions. [2024-11-25 05:03:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 05:03:51,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 538 states and 710 transitions. [2024-11-25 05:03:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 710 transitions. [2024-11-25 05:03:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 05:03:51,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 544 states and 717 transitions. [2024-11-25 05:03:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 717 transitions. [2024-11-25 05:03:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 05:03:52,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 572 states and 753 transitions. [2024-11-25 05:03:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 753 transitions. [2024-11-25 05:03:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 05:03:54,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 591 states and 770 transitions. [2024-11-25 05:03:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2024-11-25 05:03:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-25 05:03:55,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 597 states and 778 transitions. [2024-11-25 05:03:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 778 transitions. [2024-11-25 05:03:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 05:03:55,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:03:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 626 states and 814 transitions. [2024-11-25 05:03:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 814 transitions. [2024-11-25 05:03:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 05:03:57,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:03:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 643 states and 831 transitions. [2024-11-25 05:03:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 831 transitions. [2024-11-25 05:03:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 05:03:57,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 665 states and 855 transitions. [2024-11-25 05:03:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 855 transitions. [2024-11-25 05:03:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 05:03:58,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:03:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:03:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 680 states and 872 transitions. [2024-11-25 05:03:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 872 transitions. [2024-11-25 05:03:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 05:03:59,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:03:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:03:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:03:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 05:04:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 693 states and 891 transitions. [2024-11-25 05:04:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 891 transitions. [2024-11-25 05:04:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 05:04:00,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 05:04:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 698 states and 898 transitions. [2024-11-25 05:04:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 898 transitions. [2024-11-25 05:04:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 05:04:00,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 704 states and 904 transitions. [2024-11-25 05:04:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 904 transitions. [2024-11-25 05:04:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 05:04:01,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 05:04:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 709 states and 908 transitions. [2024-11-25 05:04:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 908 transitions. [2024-11-25 05:04:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 05:04:01,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 718 states and 917 transitions. [2024-11-25 05:04:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 917 transitions. [2024-11-25 05:04:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:04:02,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 741 states and 947 transitions. [2024-11-25 05:04:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 947 transitions. [2024-11-25 05:04:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:04:03,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 769 states and 980 transitions. [2024-11-25 05:04:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 980 transitions. [2024-11-25 05:04:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:04:06,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 775 states and 986 transitions. [2024-11-25 05:04:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 986 transitions. [2024-11-25 05:04:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 05:04:07,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 778 states and 989 transitions. [2024-11-25 05:04:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 989 transitions. [2024-11-25 05:04:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 05:04:07,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 779 states and 990 transitions. [2024-11-25 05:04:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 990 transitions. [2024-11-25 05:04:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 05:04:07,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 810 states and 1022 transitions. [2024-11-25 05:04:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1022 transitions. [2024-11-25 05:04:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 05:04:08,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:04:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 817 states and 1031 transitions. [2024-11-25 05:04:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1031 transitions. [2024-11-25 05:04:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 05:04:08,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:04:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 822 states and 1035 transitions. [2024-11-25 05:04:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1035 transitions. [2024-11-25 05:04:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 05:04:09,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 889 states and 1112 transitions. [2024-11-25 05:04:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1112 transitions. [2024-11-25 05:04:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 05:04:12,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 892 states and 1115 transitions. [2024-11-25 05:04:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1115 transitions. [2024-11-25 05:04:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 05:04:13,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:13,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 893 states and 1116 transitions. [2024-11-25 05:04:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1116 transitions. [2024-11-25 05:04:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 05:04:13,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 960 states and 1191 transitions. [2024-11-25 05:04:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1191 transitions. [2024-11-25 05:04:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 05:04:17,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 979 states and 1208 transitions. [2024-11-25 05:04:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1208 transitions. [2024-11-25 05:04:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 05:04:19,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:04:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 986 states and 1217 transitions. [2024-11-25 05:04:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1217 transitions. [2024-11-25 05:04:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 05:04:19,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:04:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 991 states and 1222 transitions. [2024-11-25 05:04:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1222 transitions. [2024-11-25 05:04:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 05:04:20,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 996 states and 1228 transitions. [2024-11-25 05:04:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1228 transitions. [2024-11-25 05:04:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 05:04:22,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1002 states and 1235 transitions. [2024-11-25 05:04:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1235 transitions. [2024-11-25 05:04:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:04:22,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:22,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1046 states and 1286 transitions. [2024-11-25 05:04:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1286 transitions. [2024-11-25 05:04:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:04:26,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1051 states and 1290 transitions. [2024-11-25 05:04:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1290 transitions. [2024-11-25 05:04:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:04:27,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1066 states and 1307 transitions. [2024-11-25 05:04:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1307 transitions. [2024-11-25 05:04:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 05:04:28,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1074 states and 1315 transitions. [2024-11-25 05:04:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1315 transitions. [2024-11-25 05:04:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 05:04:29,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1111 states and 1355 transitions. [2024-11-25 05:04:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1355 transitions. [2024-11-25 05:04:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 05:04:33,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:33,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1122 states and 1370 transitions. [2024-11-25 05:04:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1370 transitions. [2024-11-25 05:04:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 05:04:34,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1137 states and 1386 transitions. [2024-11-25 05:04:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1386 transitions. [2024-11-25 05:04:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 05:04:36,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1140 states and 1390 transitions. [2024-11-25 05:04:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1390 transitions. [2024-11-25 05:04:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 05:04:36,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1154 states and 1403 transitions. [2024-11-25 05:04:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1403 transitions. [2024-11-25 05:04:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 05:04:37,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 05:04:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1155 states and 1403 transitions. [2024-11-25 05:04:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1403 transitions. [2024-11-25 05:04:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 05:04:37,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1168 states and 1418 transitions. [2024-11-25 05:04:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1418 transitions. [2024-11-25 05:04:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 05:04:39,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1173 states and 1423 transitions. [2024-11-25 05:04:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1423 transitions. [2024-11-25 05:04:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 05:04:39,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1178 states and 1427 transitions. [2024-11-25 05:04:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1427 transitions. [2024-11-25 05:04:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 05:04:40,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:40,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:04:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1280 states and 1533 transitions. [2024-11-25 05:04:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1533 transitions. [2024-11-25 05:04:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 05:04:43,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:04:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1281 states and 1536 transitions. [2024-11-25 05:04:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1536 transitions. [2024-11-25 05:04:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 05:04:46,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:04:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1291 states and 1548 transitions. [2024-11-25 05:04:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1548 transitions. [2024-11-25 05:04:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 05:04:47,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:04:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1292 states and 1550 transitions. [2024-11-25 05:04:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1550 transitions. [2024-11-25 05:04:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 05:04:48,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1432 states and 1709 transitions. [2024-11-25 05:04:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1709 transitions. [2024-11-25 05:04:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 05:04:56,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:04:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1459 states and 1743 transitions. [2024-11-25 05:04:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1743 transitions. [2024-11-25 05:04:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 05:04:59,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 102 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:04:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:04:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1461 states and 1745 transitions. [2024-11-25 05:04:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1745 transitions. [2024-11-25 05:04:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 05:04:59,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:04:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:04:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:04:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 05:05:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1490 states and 1778 transitions. [2024-11-25 05:05:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1778 transitions. [2024-11-25 05:05:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 05:05:02,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 05:05:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1504 states and 1791 transitions. [2024-11-25 05:05:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1791 transitions. [2024-11-25 05:05:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 05:05:02,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 05:05:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1529 states and 1824 transitions. [2024-11-25 05:05:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1824 transitions. [2024-11-25 05:05:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 05:05:04,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 05:05:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1544 states and 1840 transitions. [2024-11-25 05:05:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1840 transitions. [2024-11-25 05:05:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 05:05:05,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 05:05:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1561 states and 1858 transitions. [2024-11-25 05:05:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1858 transitions. [2024-11-25 05:05:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-25 05:05:06,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1596 states and 1896 transitions. [2024-11-25 05:05:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1896 transitions. [2024-11-25 05:05:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:09,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:05:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1614 states and 1923 transitions. [2024-11-25 05:05:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1923 transitions. [2024-11-25 05:05:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:11,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:05:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1632 states and 1942 transitions. [2024-11-25 05:05:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1942 transitions. [2024-11-25 05:05:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:13,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:05:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1650 states and 1961 transitions. [2024-11-25 05:05:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1961 transitions. [2024-11-25 05:05:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:14,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:05:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1664 states and 1974 transitions. [2024-11-25 05:05:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1974 transitions. [2024-11-25 05:05:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:15,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 05:05:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1678 states and 1987 transitions. [2024-11-25 05:05:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1987 transitions. [2024-11-25 05:05:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:16,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:05:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1721 states and 2046 transitions. [2024-11-25 05:05:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2046 transitions. [2024-11-25 05:05:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:19,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:05:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1725 states and 2051 transitions. [2024-11-25 05:05:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2051 transitions. [2024-11-25 05:05:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:20,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:05:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 1739 states and 2064 transitions. [2024-11-25 05:05:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2064 transitions. [2024-11-25 05:05:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:20,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:05:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1754 states and 2077 transitions. [2024-11-25 05:05:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2077 transitions. [2024-11-25 05:05:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 05:05:21,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:05:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1768 states and 2090 transitions. [2024-11-25 05:05:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2090 transitions. [2024-11-25 05:05:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:05:22,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:05:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 1771 states and 2093 transitions. [2024-11-25 05:05:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2093 transitions. [2024-11-25 05:05:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:05:22,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1773 states and 2095 transitions. [2024-11-25 05:05:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2095 transitions. [2024-11-25 05:05:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 05:05:22,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:05:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1792 states and 2116 transitions. [2024-11-25 05:05:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2116 transitions. [2024-11-25 05:05:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 05:05:23,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:05:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1793 states and 2116 transitions. [2024-11-25 05:05:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2116 transitions. [2024-11-25 05:05:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:24,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:05:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1850 states and 2176 transitions. [2024-11-25 05:05:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2176 transitions. [2024-11-25 05:05:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:28,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:05:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 1861 states and 2187 transitions. [2024-11-25 05:05:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2187 transitions. [2024-11-25 05:05:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:32,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 05:05:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1864 states and 2189 transitions. [2024-11-25 05:05:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2189 transitions. [2024-11-25 05:05:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:33,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1919 states and 2258 transitions. [2024-11-25 05:05:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2258 transitions. [2024-11-25 05:05:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:40,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1957 states and 2302 transitions. [2024-11-25 05:05:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2302 transitions. [2024-11-25 05:05:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:43,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1981 states and 2330 transitions. [2024-11-25 05:05:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2330 transitions. [2024-11-25 05:05:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:47,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2007 states and 2361 transitions. [2024-11-25 05:05:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2361 transitions. [2024-11-25 05:05:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:48,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2022 states and 2375 transitions. [2024-11-25 05:05:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2375 transitions. [2024-11-25 05:05:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:51,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2027 states and 2379 transitions. [2024-11-25 05:05:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2379 transitions. [2024-11-25 05:05:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 05:05:52,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:05:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2028 states and 2383 transitions. [2024-11-25 05:05:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2383 transitions. [2024-11-25 05:05:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-25 05:05:53,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:05:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:05:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2065 states and 2436 transitions. [2024-11-25 05:05:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2436 transitions. [2024-11-25 05:05:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-25 05:05:58,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:05:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:05:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:05:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2083 states and 2455 transitions. [2024-11-25 05:06:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2455 transitions. [2024-11-25 05:06:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-25 05:06:00,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:00,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2097 states and 2468 transitions. [2024-11-25 05:06:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2468 transitions. [2024-11-25 05:06:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-25 05:06:01,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:06:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2107 states and 2479 transitions. [2024-11-25 05:06:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2479 transitions. [2024-11-25 05:06:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-25 05:06:02,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:06:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2110 states and 2481 transitions. [2024-11-25 05:06:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2481 transitions. [2024-11-25 05:06:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-25 05:06:03,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:06:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2123 states and 2494 transitions. [2024-11-25 05:06:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2494 transitions. [2024-11-25 05:06:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-25 05:06:05,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:06:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2136 states and 2509 transitions. [2024-11-25 05:06:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2509 transitions. [2024-11-25 05:06:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-25 05:06:07,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:06:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2141 states and 2513 transitions. [2024-11-25 05:06:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2513 transitions. [2024-11-25 05:06:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 05:06:08,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 05:06:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2159 states and 2543 transitions. [2024-11-25 05:06:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2543 transitions. [2024-11-25 05:06:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 05:06:11,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 169 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:06:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2195 states and 2583 transitions. [2024-11-25 05:06:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2583 transitions. [2024-11-25 05:06:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 05:06:16,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:06:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2373 states and 2781 transitions. [2024-11-25 05:06:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 2781 transitions. [2024-11-25 05:06:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:06:29,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2376 states and 2786 transitions. [2024-11-25 05:06:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2786 transitions. [2024-11-25 05:06:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 05:06:30,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:30,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2380 states and 2790 transitions. [2024-11-25 05:06:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2790 transitions. [2024-11-25 05:06:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 05:06:30,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2393 states and 2806 transitions. [2024-11-25 05:06:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2806 transitions. [2024-11-25 05:06:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 05:06:32,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2405 states and 2818 transitions. [2024-11-25 05:06:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2818 transitions. [2024-11-25 05:06:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 05:06:33,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2408 states and 2820 transitions. [2024-11-25 05:06:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2820 transitions. [2024-11-25 05:06:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:34,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2448 states and 2868 transitions. [2024-11-25 05:06:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2868 transitions. [2024-11-25 05:06:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:41,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2453 states and 2874 transitions. [2024-11-25 05:06:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2874 transitions. [2024-11-25 05:06:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:42,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2485 states and 2909 transitions. [2024-11-25 05:06:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 2909 transitions. [2024-11-25 05:06:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:47,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2486 states and 2909 transitions. [2024-11-25 05:06:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2909 transitions. [2024-11-25 05:06:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:48,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2491 states and 2914 transitions. [2024-11-25 05:06:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 2914 transitions. [2024-11-25 05:06:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 05:06:50,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2492 states and 2914 transitions. [2024-11-25 05:06:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 2914 transitions. [2024-11-25 05:06:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:06:51,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2539 states and 2967 transitions. [2024-11-25 05:06:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2967 transitions. [2024-11-25 05:06:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:06:56,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:06:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:06:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2577 states and 3008 transitions. [2024-11-25 05:06:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 3008 transitions. [2024-11-25 05:06:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:06:58,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:06:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:06:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:06:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2608 states and 3043 transitions. [2024-11-25 05:07:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3043 transitions. [2024-11-25 05:07:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:07:02,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 2614 states and 3049 transitions. [2024-11-25 05:07:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3049 transitions. [2024-11-25 05:07:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:07:03,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 2640 states and 3080 transitions. [2024-11-25 05:07:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3080 transitions. [2024-11-25 05:07:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:07:05,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 2643 states and 3083 transitions. [2024-11-25 05:07:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3083 transitions. [2024-11-25 05:07:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:07:06,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 2648 states and 3087 transitions. [2024-11-25 05:07:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3087 transitions. [2024-11-25 05:07:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 05:07:08,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2653 states and 3091 transitions. [2024-11-25 05:07:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3091 transitions. [2024-11-25 05:07:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:07:09,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:07:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 2657 states and 3095 transitions. [2024-11-25 05:07:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3095 transitions. [2024-11-25 05:07:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:07:10,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-25 05:07:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 2658 states and 3095 transitions. [2024-11-25 05:07:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3095 transitions. [2024-11-25 05:07:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 05:07:10,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-25 05:07:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 2687 states and 3125 transitions. [2024-11-25 05:07:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3125 transitions. [2024-11-25 05:07:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:07:12,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:07:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 2749 states and 3189 transitions. [2024-11-25 05:07:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3189 transitions. [2024-11-25 05:07:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:07:19,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:07:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 2789 states and 3229 transitions. [2024-11-25 05:07:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3229 transitions. [2024-11-25 05:07:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:07:22,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:07:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 2792 states and 3231 transitions. [2024-11-25 05:07:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3231 transitions. [2024-11-25 05:07:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:07:23,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:07:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 2797 states and 3235 transitions. [2024-11-25 05:07:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3235 transitions. [2024-11-25 05:07:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:07:25,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:07:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 2802 states and 3239 transitions. [2024-11-25 05:07:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3239 transitions. [2024-11-25 05:07:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:27,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 2807 states and 3244 transitions. [2024-11-25 05:07:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3244 transitions. [2024-11-25 05:07:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:29,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 2822 states and 3257 transitions. [2024-11-25 05:07:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3257 transitions. [2024-11-25 05:07:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:30,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 2837 states and 3271 transitions. [2024-11-25 05:07:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3271 transitions. [2024-11-25 05:07:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:33,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 2856 states and 3288 transitions. [2024-11-25 05:07:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3288 transitions. [2024-11-25 05:07:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:35,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 2861 states and 3292 transitions. [2024-11-25 05:07:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3292 transitions. [2024-11-25 05:07:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 05:07:36,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 05:07:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 2895 states and 3327 transitions. [2024-11-25 05:07:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3327 transitions. [2024-11-25 05:07:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 05:07:38,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-25 05:07:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 2934 states and 3367 transitions. [2024-11-25 05:07:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3367 transitions. [2024-11-25 05:07:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 05:07:42,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-25 05:07:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 2948 states and 3380 transitions. [2024-11-25 05:07:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3380 transitions. [2024-11-25 05:07:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 05:07:44,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-25 05:07:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 2950 states and 3380 transitions. [2024-11-25 05:07:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3380 transitions. [2024-11-25 05:07:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 05:07:45,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-25 05:07:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 2955 states and 3384 transitions. [2024-11-25 05:07:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3384 transitions. [2024-11-25 05:07:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 05:07:46,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-25 05:07:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3001 states and 3432 transitions. [2024-11-25 05:07:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 3432 transitions. [2024-11-25 05:07:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-25 05:07:47,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:07:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3024 states and 3459 transitions. [2024-11-25 05:07:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3459 transitions. [2024-11-25 05:07:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-25 05:07:50,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:07:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3036 states and 3471 transitions. [2024-11-25 05:07:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3471 transitions. [2024-11-25 05:07:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-25 05:07:54,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:07:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3068 states and 3508 transitions. [2024-11-25 05:07:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3508 transitions. [2024-11-25 05:07:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-25 05:07:56,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:07:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:07:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3073 states and 3513 transitions. [2024-11-25 05:07:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3513 transitions. [2024-11-25 05:07:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-25 05:07:57,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:07:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:07:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:07:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3521 states to 3080 states and 3521 transitions. [2024-11-25 05:08:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3521 transitions. [2024-11-25 05:08:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-25 05:08:00,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3085 states and 3526 transitions. [2024-11-25 05:08:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 3526 transitions. [2024-11-25 05:08:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-25 05:08:01,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-25 05:08:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3107 states and 3548 transitions. [2024-11-25 05:08:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3548 transitions. [2024-11-25 05:08:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:04,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3142 states and 3584 transitions. [2024-11-25 05:08:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 3584 transitions. [2024-11-25 05:08:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:06,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:06,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3187 states and 3628 transitions. [2024-11-25 05:08:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 3628 transitions. [2024-11-25 05:08:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:10,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3197 states and 3638 transitions. [2024-11-25 05:08:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 3638 transitions. [2024-11-25 05:08:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:13,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3202 states and 3642 transitions. [2024-11-25 05:08:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 3642 transitions. [2024-11-25 05:08:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:15,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3206 states and 3646 transitions. [2024-11-25 05:08:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 3646 transitions. [2024-11-25 05:08:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:17,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:17,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3209 states and 3648 transitions. [2024-11-25 05:08:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 3648 transitions. [2024-11-25 05:08:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-25 05:08:17,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:08:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3212 states and 3650 transitions. [2024-11-25 05:08:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 3650 transitions. [2024-11-25 05:08:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:18,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3249 states and 3692 transitions. [2024-11-25 05:08:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 3692 transitions. [2024-11-25 05:08:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:21,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3271 states and 3714 transitions. [2024-11-25 05:08:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 3714 transitions. [2024-11-25 05:08:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:27,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3281 states and 3723 transitions. [2024-11-25 05:08:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3723 transitions. [2024-11-25 05:08:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:29,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3319 states and 3762 transitions. [2024-11-25 05:08:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 3762 transitions. [2024-11-25 05:08:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:32,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3320 states and 3762 transitions. [2024-11-25 05:08:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 3762 transitions. [2024-11-25 05:08:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:33,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3327 states and 3769 transitions. [2024-11-25 05:08:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 3769 transitions. [2024-11-25 05:08:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:34,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3359 states and 3801 transitions. [2024-11-25 05:08:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 3801 transitions. [2024-11-25 05:08:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:38,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3367 states and 3808 transitions. [2024-11-25 05:08:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 3808 transitions. [2024-11-25 05:08:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:39,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3369 states and 3810 transitions. [2024-11-25 05:08:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 3810 transitions. [2024-11-25 05:08:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:40,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:08:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3370 states and 3810 transitions. [2024-11-25 05:08:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 3810 transitions. [2024-11-25 05:08:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:41,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 309 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 05:08:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3426 states and 3877 transitions. [2024-11-25 05:08:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 3877 transitions. [2024-11-25 05:08:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:51,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 309 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 05:08:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3467 states and 3920 transitions. [2024-11-25 05:08:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 3920 transitions. [2024-11-25 05:08:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 05:08:57,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 309 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 05:08:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:08:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3472 states and 3924 transitions. [2024-11-25 05:08:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 3924 transitions. [2024-11-25 05:08:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-25 05:08:58,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:08:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:08:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:08:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:09:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3495 states and 3950 transitions. [2024-11-25 05:09:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 3950 transitions. [2024-11-25 05:09:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-25 05:09:01,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:09:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3499 states and 3953 transitions. [2024-11-25 05:09:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 3953 transitions. [2024-11-25 05:09:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-25 05:09:02,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:09:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3513 states and 3967 transitions. [2024-11-25 05:09:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 3967 transitions. [2024-11-25 05:09:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-25 05:09:04,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-25 05:09:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3514 states and 3967 transitions. [2024-11-25 05:09:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 3967 transitions. [2024-11-25 05:09:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-25 05:09:06,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:09:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3517 states and 3969 transitions. [2024-11-25 05:09:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 3969 transitions. [2024-11-25 05:09:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-25 05:09:06,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:09:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 3556 states and 4013 transitions. [2024-11-25 05:09:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4013 transitions. [2024-11-25 05:09:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-25 05:09:14,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:09:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 3580 states and 4041 transitions. [2024-11-25 05:09:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4041 transitions. [2024-11-25 05:09:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-25 05:09:18,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:09:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 3600 states and 4061 transitions. [2024-11-25 05:09:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4061 transitions. [2024-11-25 05:09:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-25 05:09:24,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 05:09:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 3615 states and 4075 transitions. [2024-11-25 05:09:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4075 transitions. [2024-11-25 05:09:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-25 05:09:26,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 05:09:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 3679 states and 4147 transitions. [2024-11-25 05:09:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4147 transitions. [2024-11-25 05:09:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-25 05:09:29,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-25 05:09:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 3680 states and 4147 transitions. [2024-11-25 05:09:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4147 transitions. [2024-11-25 05:09:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-25 05:09:30,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 270 proven. 16 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-25 05:09:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 3681 states and 4150 transitions. [2024-11-25 05:09:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4150 transitions. [2024-11-25 05:09:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-25 05:09:32,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 452 proven. 110 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-25 05:09:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 3804 states and 4292 transitions. [2024-11-25 05:09:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 4292 transitions. [2024-11-25 05:09:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-25 05:09:47,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 452 proven. 110 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-25 05:09:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 3835 states and 4326 transitions. [2024-11-25 05:09:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 4326 transitions. [2024-11-25 05:09:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-25 05:09:53,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 452 proven. 110 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-25 05:09:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 3841 states and 4333 transitions. [2024-11-25 05:09:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 4333 transitions. [2024-11-25 05:09:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-25 05:09:56,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-25 05:09:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:09:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 3844 states and 4335 transitions. [2024-11-25 05:09:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 4335 transitions. [2024-11-25 05:09:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:09:57,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:09:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:09:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:09:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 3863 states and 4366 transitions. [2024-11-25 05:10:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 4366 transitions. [2024-11-25 05:10:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:03,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 3882 states and 4387 transitions. [2024-11-25 05:10:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4387 transitions. [2024-11-25 05:10:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:07,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 3888 states and 4395 transitions. [2024-11-25 05:10:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 4395 transitions. [2024-11-25 05:10:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:09,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 3889 states and 4397 transitions. [2024-11-25 05:10:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 4397 transitions. [2024-11-25 05:10:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:11,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 3894 states and 4405 transitions. [2024-11-25 05:10:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 4405 transitions. [2024-11-25 05:10:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:14,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 3897 states and 4407 transitions. [2024-11-25 05:10:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 4407 transitions. [2024-11-25 05:10:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:16,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 3902 states and 4412 transitions. [2024-11-25 05:10:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 4412 transitions. [2024-11-25 05:10:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-25 05:10:18,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-25 05:10:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 3903 states and 4414 transitions. [2024-11-25 05:10:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 4414 transitions. [2024-11-25 05:10:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-11-25 05:10:19,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-25 05:10:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 3982 states and 4495 transitions. [2024-11-25 05:10:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 4495 transitions. [2024-11-25 05:10:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-25 05:10:22,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:10:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:10:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:10:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 646 proven. 226 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-25 05:10:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:10:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4064 states and 4605 transitions. [2024-11-25 05:10:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 4605 transitions. [2024-11-25 05:10:50,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 05:10:50,119 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 205 iterations. [2024-11-25 05:10:50,130 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 05:11:25,781 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,785 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,785 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,785 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse6 (= ~a19~0 1)) (.cse7 (not (= ~a11~0 1)))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and (not .cse0) .cse6) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse7) (and .cse2 .cse7) (and .cse4 .cse0 .cse1 .cse5) (and (not (and .cse3 (= ~a28~0 11) .cse7)) .cse6) (and (not .cse6) .cse7)))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,786 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse6 (= ~a19~0 1)) (.cse7 (not (= ~a11~0 1)))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and (not .cse0) .cse6) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse7) (and .cse2 .cse7) (and .cse4 .cse0 .cse1 .cse5) (and (not (and .cse3 (= ~a28~0 11) .cse7)) .cse6) (and (not .cse6) .cse7)))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,787 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L451-1(lines 39 608) the Hoare annotation is: (not (and (not (and (= ~a17~0 8) (= ~a25~0 1) (= ~a21~0 1) (= ~a28~0 9))) (= ~a11~0 1) (not (= ~a19~0 1)))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,788 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,789 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,789 INFO L77 FloydHoareUtils]: At program point L454-1(lines 39 608) the Hoare annotation is: (not (and (not (and (= ~a17~0 8) (= ~a25~0 1) (= ~a21~0 1) (= ~a28~0 9))) (= ~a11~0 1) (not (= ~a19~0 1)))) [2024-11-25 05:11:25,789 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,789 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 05:11:25,789 INFO L75 FloydHoareUtils]: For program point L455(line 455) no Hoare annotation was computed. [2024-11-25 05:11:25,793 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,793 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,794 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,794 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,794 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,794 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,794 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,795 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,795 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,795 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2024-11-25 05:11:25,795 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse4 (= ~a25~0 1))) (let ((.cse2 (not .cse4)) (.cse3 (= ~a17~0 8)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9)) (.cse6 (= ~a19~0 1)) (.cse7 (not .cse8))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse6 (< ~a28~0 9)) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and (<= 10 ~a28~0) .cse7) (and (not (and .cse3 .cse0)) .cse7) (and .cse8 .cse6) (and .cse4 .cse0 .cse1 .cse5) (and (not .cse6) .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse7)))) [2024-11-25 05:11:25,795 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,796 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,796 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,796 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,796 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,796 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10)) (.cse9 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9)))) [2024-11-25 05:11:25,797 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,797 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,797 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,797 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,798 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,798 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10)) (.cse9 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9)))) [2024-11-25 05:11:25,799 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,799 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10)) (.cse9 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9)))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,800 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10)) (.cse9 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9)))) [2024-11-25 05:11:25,801 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,802 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,802 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,802 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,802 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10)) (.cse9 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9)))) [2024-11-25 05:11:25,802 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,803 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,803 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 05:11:25,803 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,804 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,804 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,804 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,804 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,805 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse5 (= ~a25~0 1))) (let ((.cse3 (not .cse5)) (.cse1 (= ~a21~0 1)) (.cse2 (= 7 ~a17~0)) (.cse6 (= ~a28~0 9)) (.cse7 (= ~a19~0 1)) (.cse9 (not .cse8)) (.cse4 (= ~a17~0 8)) (.cse0 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and (not .cse1) .cse7) (and .cse4 (= 7 ~a28~0) .cse1 .cse3) (and .cse8 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and .cse5 .cse1 .cse2 .cse6) (and (not .cse7) .cse9) (and .cse9 (not (and .cse4 .cse0)))))) [2024-11-25 05:11:25,805 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse4)) (.cse0 (= ~a21~0 1)) (.cse1 (= 7 ~a17~0)) (.cse5 (= ~a28~0 9))) (or (and (= ~a28~0 10) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse3 (= 7 ~a28~0) .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse5) (= ~a19~0 1) (not (= ~a11~0 1))))) [2024-11-25 05:11:25,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 05:11:25 ImpRootNode [2024-11-25 05:11:25,826 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 05:11:25,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 05:11:25,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 05:11:25,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 05:11:25,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:30" (3/4) ... [2024-11-25 05:11:25,831 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 05:11:25,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2024-11-25 05:11:25,860 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 05:11:25,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-25 05:11:25,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 05:11:26,057 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 05:11:26,058 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 05:11:26,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 05:11:26,059 INFO L158 Benchmark]: Toolchain (without parser) took 478740.73ms. Allocated memory was 142.6MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 103.0MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-25 05:11:26,060 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:11:26,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.99ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 76.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 05:11:26,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.80ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 71.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:11:26,061 INFO L158 Benchmark]: Boogie Preprocessor took 83.34ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 67.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:11:26,062 INFO L158 Benchmark]: RCFGBuilder took 2405.46ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 67.5MB in the beginning and 283.9MB in the end (delta: -216.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-25 05:11:26,062 INFO L158 Benchmark]: CodeCheck took 475319.15ms. Allocated memory was 360.7MB in the beginning and 5.4GB in the end (delta: 5.0GB). Free memory was 283.9MB in the beginning and 4.3GB in the end (delta: -4.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-25 05:11:26,063 INFO L158 Benchmark]: Witness Printer took 231.48ms. Allocated memory is still 5.4GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 05:11:26,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 439.6s, OverallIterations: 205, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 936903 SdHoareTripleChecker+Valid, 2659.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919441 mSDsluCounter, 98713 SdHoareTripleChecker+Invalid, 2278.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84371 mSDsCounter, 154112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1896261 IncrementalHoareTripleChecker+Invalid, 2050373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154112 mSolverCounterUnsat, 14342 mSDtfsCounter, 1896261 mSolverCounterSat, 21.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285612 GetRequests, 275245 SyntacticMatches, 8599 SemanticMatches, 1768 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048573 ImplicationChecksByTransitivity, 357.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 34.3s InterpolantComputationTime, 44159 NumberOfCodeBlocks, 44159 NumberOfCodeBlocksAsserted, 204 NumberOfCheckSat, 43955 ConstructedInterpolants, 0 QuantifiedInterpolants, 127654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 204 InterpolantComputations, 164 PerfectInterpolantSequences, 49997/51095 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 455]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((((((a28 == 10) && (a21 == 1)) && (7 == a17)) && (a25 != 1)) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a28 == 9))) || ((((a17 == 8) && (7 == a28)) && (a21 == 1)) && (a25 != 1))) || ((((a25 == 1) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (a19 == 1)) || (a11 != 1)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((((((a28 == 10) && (a21 == 1)) && (7 == a17)) && (a25 != 1)) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a28 == 9))) || ((((a17 == 8) && (7 == a28)) && (a21 == 1)) && (a25 != 1))) || ((((a25 == 1) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (a19 == 1)) || (a11 != 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.99ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 76.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.80ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 71.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.34ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 67.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2405.46ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 67.5MB in the beginning and 283.9MB in the end (delta: -216.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * CodeCheck took 475319.15ms. Allocated memory was 360.7MB in the beginning and 5.4GB in the end (delta: 5.0GB). Free memory was 283.9MB in the beginning and 4.3GB in the end (delta: -4.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 231.48ms. Allocated memory is still 5.4GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 05:11:26,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8415266-0ef3-4d9a-b8a2-0b2839489689/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE