./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:57:47,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:57:47,144 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:57:47,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:57:47,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:57:47,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:57:47,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:57:47,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:57:47,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:57:47,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:57:47,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:57:47,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:57:47,171 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:57:47,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:57:47,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:57:47,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:57:47,171 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_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2024-12-05 23:57:47,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:57:47,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:57:47,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:57:47,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:57:47,431 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:57:47,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-12-05 23:57:50,111 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/data/c4185a5d0/031cde96f8074a99b8ac0ffc4b626358/FLAGc48e1540d [2024-12-05 23:57:50,373 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:57:50,374 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-12-05 23:57:50,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/data/c4185a5d0/031cde96f8074a99b8ac0ffc4b626358/FLAGc48e1540d [2024-12-05 23:57:50,399 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/data/c4185a5d0/031cde96f8074a99b8ac0ffc4b626358 [2024-12-05 23:57:50,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:57:50,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:57:50,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:57:50,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:57:50,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:57:50,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8be720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50, skipping insertion in model container [2024-12-05 23:57:50,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:57:50,683 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_53ad8bda-2850-479c-9113-fdb0cc755d4a/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-12-05 23:57:50,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:57:50,718 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:57:50,785 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_53ad8bda-2850-479c-9113-fdb0cc755d4a/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-12-05 23:57:50,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:57:50,811 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:57:50,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50 WrapperNode [2024-12-05 23:57:50,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:57:50,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:57:50,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:57:50,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:57:50,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,869 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 23:57:50,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:57:50,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:57:50,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:57:50,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:57:50,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:57:50,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:57:50,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:57:50,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:57:50,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:57:50" (1/1) ... [2024-12-05 23:57:50,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:57:50,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:57:50,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:57:50,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:57:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:57:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:57:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:57:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:57:51,042 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:57:51,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:57:51,916 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 23:57:51,917 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:57:52,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:57:52,101 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 23:57:52,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:57:52 BoogieIcfgContainer [2024-12-05 23:57:52,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:57:52,102 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:57:52,102 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:57:52,109 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:57:52,109 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:57:52" (1/1) ... [2024-12-05 23:57:52,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:57:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 23:57:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 23:57:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 23:57:52,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-05 23:57:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-05 23:57:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 23:57:53,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-12-05 23:57:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-12-05 23:57:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-05 23:57:53,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-12-05 23:57:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-12-05 23:57:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 23:57:53,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-12-05 23:57:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-12-05 23:57:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-05 23:57:55,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-12-05 23:57:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-12-05 23:57:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-05 23:57:55,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-12-05 23:57:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-12-05 23:57:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-05 23:57:55,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-12-05 23:57:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-12-05 23:57:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-05 23:57:55,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:55,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-12-05 23:57:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-12-05 23:57:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 23:57:56,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-12-05 23:57:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-12-05 23:57:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 23:57:56,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-12-05 23:57:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-12-05 23:57:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-05 23:57:57,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-12-05 23:57:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-12-05 23:57:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-05 23:57:57,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:57:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-12-05 23:57:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-12-05 23:57:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 23:57:57,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:57:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-12-05 23:57:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-12-05 23:57:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 23:57:57,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-12-05 23:57:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-12-05 23:57:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 23:57:58,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-12-05 23:57:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-12-05 23:57:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 23:57:59,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:57:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-12-05 23:57:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-12-05 23:57:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 23:57:59,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-12-05 23:57:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-12-05 23:57:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 23:57:59,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 23:58:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-12-05 23:58:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-12-05 23:58:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 23:58:00,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:00,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-12-05 23:58:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-12-05 23:58:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 23:58:00,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:58:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-12-05 23:58:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-12-05 23:58:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-05 23:58:00,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:58:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-12-05 23:58:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-12-05 23:58:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-05 23:58:00,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-12-05 23:58:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-12-05 23:58:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 23:58:01,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:58:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 374 states and 482 transitions. [2024-12-05 23:58:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2024-12-05 23:58:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 23:58:01,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 382 states and 492 transitions. [2024-12-05 23:58:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 492 transitions. [2024-12-05 23:58:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-05 23:58:02,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 385 states and 496 transitions. [2024-12-05 23:58:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2024-12-05 23:58:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-05 23:58:02,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 387 states and 500 transitions. [2024-12-05 23:58:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2024-12-05 23:58:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-05 23:58:03,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 406 states and 521 transitions. [2024-12-05 23:58:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-12-05 23:58:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-05 23:58:03,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 408 states and 523 transitions. [2024-12-05 23:58:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2024-12-05 23:58:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-05 23:58:03,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:58:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 422 states and 537 transitions. [2024-12-05 23:58:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-12-05 23:58:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-05 23:58:03,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 430 states and 548 transitions. [2024-12-05 23:58:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 548 transitions. [2024-12-05 23:58:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 23:58:04,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:58:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 470 states and 590 transitions. [2024-12-05 23:58:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2024-12-05 23:58:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 23:58:04,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:58:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 475 states and 595 transitions. [2024-12-05 23:58:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 595 transitions. [2024-12-05 23:58:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 23:58:05,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:58:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 480 states and 601 transitions. [2024-12-05 23:58:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 601 transitions. [2024-12-05 23:58:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 23:58:05,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:58:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 483 states and 605 transitions. [2024-12-05 23:58:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 605 transitions. [2024-12-05 23:58:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-05 23:58:05,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 23:58:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 485 states and 608 transitions. [2024-12-05 23:58:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 608 transitions. [2024-12-05 23:58:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 23:58:06,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 23:58:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 488 states and 611 transitions. [2024-12-05 23:58:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 611 transitions. [2024-12-05 23:58:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 23:58:06,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 538 states and 666 transitions. [2024-12-05 23:58:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 666 transitions. [2024-12-05 23:58:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 23:58:07,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 540 states and 667 transitions. [2024-12-05 23:58:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2024-12-05 23:58:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 23:58:07,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 23:58:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 543 states and 670 transitions. [2024-12-05 23:58:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2024-12-05 23:58:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 23:58:07,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 563 states and 691 transitions. [2024-12-05 23:58:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 691 transitions. [2024-12-05 23:58:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:58:07,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-12-05 23:58:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-12-05 23:58:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 23:58:09,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 772 states and 931 transitions. [2024-12-05 23:58:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 931 transitions. [2024-12-05 23:58:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-05 23:58:11,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 826 states and 992 transitions. [2024-12-05 23:58:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 992 transitions. [2024-12-05 23:58:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 23:58:13,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 843 states and 1011 transitions. [2024-12-05 23:58:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1011 transitions. [2024-12-05 23:58:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 23:58:14,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 845 states and 1012 transitions. [2024-12-05 23:58:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1012 transitions. [2024-12-05 23:58:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-05 23:58:14,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 858 states and 1027 transitions. [2024-12-05 23:58:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1027 transitions. [2024-12-05 23:58:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-05 23:58:15,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 23:58:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 872 states and 1044 transitions. [2024-12-05 23:58:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1044 transitions. [2024-12-05 23:58:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-05 23:58:15,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-05 23:58:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 893 states and 1063 transitions. [2024-12-05 23:58:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1063 transitions. [2024-12-05 23:58:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:58:16,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 923 states and 1097 transitions. [2024-12-05 23:58:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1097 transitions. [2024-12-05 23:58:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 23:58:17,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:58:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 937 states and 1109 transitions. [2024-12-05 23:58:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1109 transitions. [2024-12-05 23:58:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 23:58:17,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 954 states and 1127 transitions. [2024-12-05 23:58:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1127 transitions. [2024-12-05 23:58:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:58:18,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:58:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1000 states and 1180 transitions. [2024-12-05 23:58:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1180 transitions. [2024-12-05 23:58:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:58:18,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:58:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1001 states and 1180 transitions. [2024-12-05 23:58:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1180 transitions. [2024-12-05 23:58:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 23:58:19,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1072 states and 1267 transitions. [2024-12-05 23:58:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1267 transitions. [2024-12-05 23:58:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-05 23:58:20,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1081 states and 1277 transitions. [2024-12-05 23:58:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1277 transitions. [2024-12-05 23:58:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-05 23:58:21,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1121 states and 1324 transitions. [2024-12-05 23:58:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1324 transitions. [2024-12-05 23:58:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 23:58:23,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 23:58:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1214 states and 1439 transitions. [2024-12-05 23:58:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1439 transitions. [2024-12-05 23:58:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 23:58:25,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 23:58:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1216 states and 1442 transitions. [2024-12-05 23:58:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1442 transitions. [2024-12-05 23:58:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 23:58:25,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:58:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1243 states and 1473 transitions. [2024-12-05 23:58:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1473 transitions. [2024-12-05 23:58:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-05 23:58:26,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:58:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1273 states and 1505 transitions. [2024-12-05 23:58:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1505 transitions. [2024-12-05 23:58:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-05 23:58:27,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 23:58:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1289 states and 1520 transitions. [2024-12-05 23:58:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1520 transitions. [2024-12-05 23:58:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 23:58:27,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:58:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1318 states and 1552 transitions. [2024-12-05 23:58:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1552 transitions. [2024-12-05 23:58:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:58:28,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1334 states and 1569 transitions. [2024-12-05 23:58:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1569 transitions. [2024-12-05 23:58:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:58:29,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1339 states and 1573 transitions. [2024-12-05 23:58:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1573 transitions. [2024-12-05 23:58:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:58:29,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 23:58:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1371 states and 1606 transitions. [2024-12-05 23:58:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1606 transitions. [2024-12-05 23:58:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:58:32,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1385 states and 1623 transitions. [2024-12-05 23:58:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1623 transitions. [2024-12-05 23:58:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:58:32,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-05 23:58:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1386 states and 1624 transitions. [2024-12-05 23:58:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1624 transitions. [2024-12-05 23:58:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:58:33,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 23:58:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1427 states and 1667 transitions. [2024-12-05 23:58:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1667 transitions. [2024-12-05 23:58:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:58:35,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:58:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1587 states and 1851 transitions. [2024-12-05 23:58:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1851 transitions. [2024-12-05 23:58:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-05 23:58:38,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1617 states and 1894 transitions. [2024-12-05 23:58:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1894 transitions. [2024-12-05 23:58:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-05 23:58:40,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:40,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1618 states and 1895 transitions. [2024-12-05 23:58:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1895 transitions. [2024-12-05 23:58:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:58:40,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:58:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1683 states and 1978 transitions. [2024-12-05 23:58:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1978 transitions. [2024-12-05 23:58:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 23:58:42,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1732 states and 2035 transitions. [2024-12-05 23:58:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2035 transitions. [2024-12-05 23:58:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-05 23:58:44,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1780 states and 2089 transitions. [2024-12-05 23:58:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2089 transitions. [2024-12-05 23:58:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:58:47,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:58:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1832 states and 2156 transitions. [2024-12-05 23:58:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2156 transitions. [2024-12-05 23:58:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:58:49,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:58:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1870 states and 2195 transitions. [2024-12-05 23:58:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2195 transitions. [2024-12-05 23:58:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:58:50,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:58:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1876 states and 2202 transitions. [2024-12-05 23:58:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2202 transitions. [2024-12-05 23:58:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-05 23:58:50,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 23:58:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1885 states and 2214 transitions. [2024-12-05 23:58:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2214 transitions. [2024-12-05 23:58:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:58:51,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 23:58:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1929 states and 2265 transitions. [2024-12-05 23:58:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2265 transitions. [2024-12-05 23:58:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:58:53,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:53,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 23:58:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1930 states and 2267 transitions. [2024-12-05 23:58:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2267 transitions. [2024-12-05 23:58:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:58:53,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1943 states and 2281 transitions. [2024-12-05 23:58:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2281 transitions. [2024-12-05 23:58:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:58:54,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 23:58:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1977 states and 2318 transitions. [2024-12-05 23:58:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2318 transitions. [2024-12-05 23:58:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:58:55,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 23:58:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1986 states and 2326 transitions. [2024-12-05 23:58:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2326 transitions. [2024-12-05 23:58:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:58:56,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:58:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2082 states and 2428 transitions. [2024-12-05 23:58:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2428 transitions. [2024-12-05 23:58:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-05 23:58:58,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:58:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2095 states and 2442 transitions. [2024-12-05 23:58:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2442 transitions. [2024-12-05 23:58:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-05 23:58:59,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-05 23:59:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2108 states and 2456 transitions. [2024-12-05 23:59:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2456 transitions. [2024-12-05 23:59:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 23:59:00,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:59:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2131 states and 2481 transitions. [2024-12-05 23:59:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2481 transitions. [2024-12-05 23:59:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 23:59:02,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 23:59:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2133 states and 2491 transitions. [2024-12-05 23:59:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2491 transitions. [2024-12-05 23:59:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 23:59:04,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 23:59:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2161 states and 2520 transitions. [2024-12-05 23:59:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2520 transitions. [2024-12-05 23:59:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 23:59:05,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 23:59:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2163 states and 2537 transitions. [2024-12-05 23:59:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2537 transitions. [2024-12-05 23:59:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 23:59:06,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 23:59:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2191 states and 2565 transitions. [2024-12-05 23:59:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2565 transitions. [2024-12-05 23:59:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:59:07,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 23:59:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2206 states and 2585 transitions. [2024-12-05 23:59:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2585 transitions. [2024-12-05 23:59:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:59:08,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 23:59:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2221 states and 2599 transitions. [2024-12-05 23:59:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2599 transitions. [2024-12-05 23:59:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:59:09,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 23:59:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2260 states and 2651 transitions. [2024-12-05 23:59:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2651 transitions. [2024-12-05 23:59:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:59:11,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:59:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2287 states and 2683 transitions. [2024-12-05 23:59:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2683 transitions. [2024-12-05 23:59:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 23:59:12,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 23:59:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2301 states and 2702 transitions. [2024-12-05 23:59:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2702 transitions. [2024-12-05 23:59:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 23:59:13,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 23:59:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2327 states and 2730 transitions. [2024-12-05 23:59:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2730 transitions. [2024-12-05 23:59:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 23:59:14,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 23:59:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2352 states and 2755 transitions. [2024-12-05 23:59:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2755 transitions. [2024-12-05 23:59:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 23:59:15,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:59:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2387 states and 2796 transitions. [2024-12-05 23:59:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2796 transitions. [2024-12-05 23:59:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:59:16,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 23:59:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2400 states and 2810 transitions. [2024-12-05 23:59:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2810 transitions. [2024-12-05 23:59:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:59:16,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 23:59:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2425 states and 2834 transitions. [2024-12-05 23:59:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2834 transitions. [2024-12-05 23:59:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:59:17,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 23:59:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2450 states and 2858 transitions. [2024-12-05 23:59:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2858 transitions. [2024-12-05 23:59:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-05 23:59:18,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 23:59:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2558 states and 2984 transitions. [2024-12-05 23:59:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 2984 transitions. [2024-12-05 23:59:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 23:59:20,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:59:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 2595 states and 3030 transitions. [2024-12-05 23:59:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3030 transitions. [2024-12-05 23:59:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 23:59:22,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:59:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 2619 states and 3054 transitions. [2024-12-05 23:59:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3054 transitions. [2024-12-05 23:59:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 23:59:23,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:59:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 2644 states and 3081 transitions. [2024-12-05 23:59:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3081 transitions. [2024-12-05 23:59:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:59:25,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 23:59:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 2668 states and 3112 transitions. [2024-12-05 23:59:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3112 transitions. [2024-12-05 23:59:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:59:27,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 23:59:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 2674 states and 3120 transitions. [2024-12-05 23:59:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3120 transitions. [2024-12-05 23:59:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:59:28,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:59:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 2699 states and 3158 transitions. [2024-12-05 23:59:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3158 transitions. [2024-12-05 23:59:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:59:30,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:59:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 2700 states and 3163 transitions. [2024-12-05 23:59:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3163 transitions. [2024-12-05 23:59:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:31,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:59:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 2751 states and 3222 transitions. [2024-12-05 23:59:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3222 transitions. [2024-12-05 23:59:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:32,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-05 23:59:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 2787 states and 3261 transitions. [2024-12-05 23:59:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3261 transitions. [2024-12-05 23:59:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:35,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 2821 states and 3299 transitions. [2024-12-05 23:59:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3299 transitions. [2024-12-05 23:59:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:36,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 2836 states and 3331 transitions. [2024-12-05 23:59:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3331 transitions. [2024-12-05 23:59:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:38,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 2849 states and 3347 transitions. [2024-12-05 23:59:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3347 transitions. [2024-12-05 23:59:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:39,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 2875 states and 3375 transitions. [2024-12-05 23:59:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3375 transitions. [2024-12-05 23:59:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:40,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 2900 states and 3402 transitions. [2024-12-05 23:59:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3402 transitions. [2024-12-05 23:59:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:41,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2901 states and 3403 transitions. [2024-12-05 23:59:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3403 transitions. [2024-12-05 23:59:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:41,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 2914 states and 3417 transitions. [2024-12-05 23:59:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3417 transitions. [2024-12-05 23:59:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:42,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 2915 states and 3418 transitions. [2024-12-05 23:59:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3418 transitions. [2024-12-05 23:59:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:59:43,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 23:59:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 2928 states and 3431 transitions. [2024-12-05 23:59:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3431 transitions. [2024-12-05 23:59:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:43,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 2930 states and 3438 transitions. [2024-12-05 23:59:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 3438 transitions. [2024-12-05 23:59:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:45,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 2968 states and 3475 transitions. [2024-12-05 23:59:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 3475 transitions. [2024-12-05 23:59:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:46,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 2994 states and 3508 transitions. [2024-12-05 23:59:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3508 transitions. [2024-12-05 23:59:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:47,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3017 states and 3530 transitions. [2024-12-05 23:59:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3530 transitions. [2024-12-05 23:59:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:48,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3030 states and 3543 transitions. [2024-12-05 23:59:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3543 transitions. [2024-12-05 23:59:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:59:49,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:59:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3043 states and 3556 transitions. [2024-12-05 23:59:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3556 transitions. [2024-12-05 23:59:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:59:49,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:59:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3099 states and 3623 transitions. [2024-12-05 23:59:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3623 transitions. [2024-12-05 23:59:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:59:54,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:59:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3165 states and 3697 transitions. [2024-12-05 23:59:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 3697 transitions. [2024-12-05 23:59:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:59:58,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:00:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3201 states and 3735 transitions. [2024-12-06 00:00:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 3735 transitions. [2024-12-06 00:00:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:00:01,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:00:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3212 states and 3745 transitions. [2024-12-06 00:00:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 3745 transitions. [2024-12-06 00:00:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:00:02,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:00:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3249 states and 3791 transitions. [2024-12-06 00:00:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 3791 transitions. [2024-12-06 00:00:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:00:05,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 172 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:00:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3285 states and 3828 transitions. [2024-12-06 00:00:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 3828 transitions. [2024-12-06 00:00:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:00:09,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:00:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3343 states and 3894 transitions. [2024-12-06 00:00:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 3894 transitions. [2024-12-06 00:00:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 00:00:11,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 00:00:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3349 states and 3901 transitions. [2024-12-06 00:00:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 3901 transitions. [2024-12-06 00:00:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:00:12,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 00:00:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3365 states and 3919 transitions. [2024-12-06 00:00:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 3919 transitions. [2024-12-06 00:00:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:00:13,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 00:00:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3381 states and 3935 transitions. [2024-12-06 00:00:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 3935 transitions. [2024-12-06 00:00:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:00:13,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 00:00:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3401 states and 3957 transitions. [2024-12-06 00:00:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 3957 transitions. [2024-12-06 00:00:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 00:00:15,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-06 00:00:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3417 states and 3973 transitions. [2024-12-06 00:00:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 3973 transitions. [2024-12-06 00:00:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 00:00:16,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:00:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3442 states and 3998 transitions. [2024-12-06 00:00:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 3998 transitions. [2024-12-06 00:00:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 00:00:18,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 00:00:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 3454 states and 4010 transitions. [2024-12-06 00:00:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4010 transitions. [2024-12-06 00:00:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 00:00:18,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-12-06 00:00:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 3468 states and 4026 transitions. [2024-12-06 00:00:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 4026 transitions. [2024-12-06 00:00:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 00:00:20,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:00:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 3489 states and 4049 transitions. [2024-12-06 00:00:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4049 transitions. [2024-12-06 00:00:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:00:21,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-06 00:00:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 3509 states and 4068 transitions. [2024-12-06 00:00:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 4068 transitions. [2024-12-06 00:00:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:00:23,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:00:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 3512 states and 4072 transitions. [2024-12-06 00:00:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4072 transitions. [2024-12-06 00:00:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:00:23,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:00:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 3641 states and 4219 transitions. [2024-12-06 00:00:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4219 transitions. [2024-12-06 00:00:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 00:00:29,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 188 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:00:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 3668 states and 4247 transitions. [2024-12-06 00:00:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4247 transitions. [2024-12-06 00:00:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-12-06 00:00:32,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 223 proven. 165 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:00:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 3695 states and 4280 transitions. [2024-12-06 00:00:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 4280 transitions. [2024-12-06 00:00:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-06 00:00:34,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 00:00:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 3804 states and 4406 transitions. [2024-12-06 00:00:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 4406 transitions. [2024-12-06 00:00:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:00:39,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:00:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 3853 states and 4471 transitions. [2024-12-06 00:00:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4471 transitions. [2024-12-06 00:00:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:00:44,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:00:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 3863 states and 4483 transitions. [2024-12-06 00:00:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 4483 transitions. [2024-12-06 00:00:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:00:46,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:00:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 3959 states and 4589 transitions. [2024-12-06 00:00:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 4589 transitions. [2024-12-06 00:00:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 00:00:50,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 417 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 00:00:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 3977 states and 4611 transitions. [2024-12-06 00:00:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 4611 transitions. [2024-12-06 00:00:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 00:00:54,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 00:00:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 3982 states and 4620 transitions. [2024-12-06 00:00:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 4620 transitions. [2024-12-06 00:00:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:00:56,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 00:00:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4008 states and 4647 transitions. [2024-12-06 00:00:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 4647 transitions. [2024-12-06 00:00:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:00:57,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 00:01:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:01:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4042 states and 4683 transitions. [2024-12-06 00:01:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4042 states and 4683 transitions. [2024-12-06 00:01:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:01:00,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:01:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:01:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:01:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 00:01:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:01:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4098 states and 4748 transitions. [2024-12-06 00:01:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4748 transitions. [2024-12-06 00:01:09,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 00:01:09,020 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 158 iterations. [2024-12-06 00:01:09,029 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 00:01:50,715 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,715 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,716 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,716 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,716 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,716 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,716 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,717 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,717 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,717 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,717 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,717 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,718 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,718 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,718 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,718 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,718 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,719 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,719 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,719 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,719 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,720 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,721 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L482-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,722 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,723 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-12-06 00:01:50,723 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,723 INFO L75 FloydHoareUtils]: For program point L486(line 486) no Hoare annotation was computed. [2024-12-06 00:01:50,723 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,723 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 00:01:50,724 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,725 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,726 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,727 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 486) no Hoare annotation was computed. [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,727 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,728 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,728 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 00:01:50,728 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 00:01:50,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:01:50 ImpRootNode [2024-12-06 00:01:50,741 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:01:50,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:01:50,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:01:50,742 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:01:50,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:57:52" (3/4) ... [2024-12-06 00:01:50,745 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 00:01:50,757 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-12-06 00:01:50,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 00:01:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 00:01:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 00:01:50,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:01:50,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:01:50,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:01:50,876 INFO L158 Benchmark]: Toolchain (without parser) took 240472.79ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 114.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-06 00:01:50,876 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:01:50,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.79ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 87.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:01:50,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 82.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:01:50,877 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 78.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:01:50,877 INFO L158 Benchmark]: RCFGBuilder took 1181.46ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 64.3MB in the end (delta: 13.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-12-06 00:01:50,877 INFO L158 Benchmark]: CodeCheck took 238639.29ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 64.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-06 00:01:50,878 INFO L158 Benchmark]: Witness Printer took 132.97ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:01:50,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 196.9s, OverallIterations: 158, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 606666 SdHoareTripleChecker+Valid, 1238.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604143 mSDsluCounter, 83357 SdHoareTripleChecker+Invalid, 1061.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71130 mSDsCounter, 102201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268858 IncrementalHoareTripleChecker+Invalid, 1371059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102201 mSolverCounterUnsat, 12227 mSDtfsCounter, 1268858 mSolverCounterSat, 8.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203796 GetRequests, 195270 SyntacticMatches, 7118 SemanticMatches, 1408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273041 ImplicationChecksByTransitivity, 140.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 30460 NumberOfCodeBlocks, 30460 NumberOfCodeBlocksAsserted, 157 NumberOfCheckSat, 30303 ConstructedInterpolants, 0 QuantifiedInterpolants, 158673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 157 InterpolantComputations, 80 PerfectInterpolantSequences, 30060/35746 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: 486]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.79ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 87.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 82.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 78.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1181.46ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 64.3MB in the end (delta: 13.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * CodeCheck took 238639.29ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 64.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 132.97ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 00:01:50,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53ad8bda-2850-479c-9113-fdb0cc755d4a/bin/ukojak-verify-CZk0znPC7b/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