./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:48:32,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:48:32,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:48:32,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:48:32,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:48:32,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:48:32,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:48:32,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:48:32,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:48:32,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:48:32,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:48:32,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:48:32,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:48:32,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:48:32,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:48:32,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:48:32,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:48:32,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:48:32,226 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:48:32,226 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:48:32,226 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:48:32,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:48:32,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:32,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:48:32,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:48:32,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:48:32,227 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:48:32,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:48:32,228 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_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de [2024-11-25 04:48:32,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:48:32,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:48:32,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:48:32,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:48:32,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:48:32,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-25 04:48:36,219 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/data/b642f98a3/7f12a1193533416588484af414484129/FLAG5b5fafd3c [2024-11-25 04:48:36,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:48:36,676 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-25 04:48:36,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/data/b642f98a3/7f12a1193533416588484af414484129/FLAG5b5fafd3c [2024-11-25 04:48:36,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/data/b642f98a3/7f12a1193533416588484af414484129 [2024-11-25 04:48:36,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:48:36,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:48:36,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:36,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:48:36,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:48:36,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:36" (1/1) ... [2024-11-25 04:48:36,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503e9d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:36, skipping insertion in model container [2024-11-25 04:48:36,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:36" (1/1) ... [2024-11-25 04:48:36,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:48:37,194 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_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-25 04:48:37,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:37,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:48:37,484 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_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-25 04:48:37,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:37,544 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:48:37,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37 WrapperNode [2024-11-25 04:48:37,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:37,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:37,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:48:37,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:48:37,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,676 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 04:48:37,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:37,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:48:37,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:48:37,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:48:37,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:48:37,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:48:37,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:48:37,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:48:37,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:37" (1/1) ... [2024-11-25 04:48:37,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:48:37,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:48:37,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:48:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:48:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:48:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:48:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:48:37,995 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:48:37,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:48:39,727 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 04:48:39,729 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:48:40,196 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:48:40,196 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 04:48:40,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:40 BoogieIcfgContainer [2024-11-25 04:48:40,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:48:40,198 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:48:40,198 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:48:40,212 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:48:40,213 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:40" (1/1) ... [2024-11-25 04:48:40,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:48:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 04:48:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 04:48:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 04:48:40,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-25 04:48:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-25 04:48:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 04:48:42,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-25 04:48:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-25 04:48:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 04:48:42,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-25 04:48:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-25 04:48:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 04:48:43,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-25 04:48:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-25 04:48:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-25 04:48:44,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-25 04:48:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-25 04:48:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-25 04:48:45,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-25 04:48:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-25 04:48:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 04:48:45,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-25 04:48:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-25 04:48:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 04:48:46,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-25 04:48:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-25 04:48:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:48:46,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-25 04:48:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-25 04:48:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 04:48:47,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-25 04:48:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-25 04:48:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-25 04:48:47,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-25 04:48:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-25 04:48:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 04:48:48,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:48:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-25 04:48:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-25 04:48:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 04:48:48,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:48:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-25 04:48:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-25 04:48:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 04:48:49,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-25 04:48:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-25 04:48:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 04:48:50,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-25 04:48:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-25 04:48:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 04:48:51,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-25 04:48:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-25 04:48:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 04:48:51,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-25 04:48:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-25 04:48:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 04:48:52,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:48:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-25 04:48:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-25 04:48:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 04:48:53,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-25 04:48:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-25 04:48:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 04:48:53,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:48:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-25 04:48:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-25 04:48:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 04:48:54,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:48:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-25 04:48:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-25 04:48:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 04:48:54,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-25 04:48:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-25 04:48:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 04:48:55,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:48:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 374 states and 482 transitions. [2024-11-25 04:48:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2024-11-25 04:48:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 04:48:56,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 382 states and 492 transitions. [2024-11-25 04:48:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 492 transitions. [2024-11-25 04:48:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-25 04:48:57,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 385 states and 496 transitions. [2024-11-25 04:48:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2024-11-25 04:48:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 04:48:58,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 387 states and 500 transitions. [2024-11-25 04:48:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2024-11-25 04:48:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 04:48:59,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 406 states and 521 transitions. [2024-11-25 04:48:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-11-25 04:48:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-25 04:48:59,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:48:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 408 states and 523 transitions. [2024-11-25 04:48:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2024-11-25 04:48:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 04:48:59,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:49:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 422 states and 537 transitions. [2024-11-25 04:49:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-11-25 04:49:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 04:49:00,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 430 states and 548 transitions. [2024-11-25 04:49:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 548 transitions. [2024-11-25 04:49:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 04:49:00,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:49:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 470 states and 590 transitions. [2024-11-25 04:49:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2024-11-25 04:49:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 04:49:01,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:49:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 475 states and 595 transitions. [2024-11-25 04:49:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 595 transitions. [2024-11-25 04:49:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 04:49:02,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 04:49:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 480 states and 601 transitions. [2024-11-25 04:49:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 601 transitions. [2024-11-25 04:49:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 04:49:02,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:49:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 483 states and 605 transitions. [2024-11-25 04:49:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 605 transitions. [2024-11-25 04:49:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 04:49:03,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:49:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 485 states and 608 transitions. [2024-11-25 04:49:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 608 transitions. [2024-11-25 04:49:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 04:49:04,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 04:49:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 488 states and 611 transitions. [2024-11-25 04:49:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 611 transitions. [2024-11-25 04:49:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 04:49:04,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 538 states and 666 transitions. [2024-11-25 04:49:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 666 transitions. [2024-11-25 04:49:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 04:49:06,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 540 states and 667 transitions. [2024-11-25 04:49:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2024-11-25 04:49:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 04:49:06,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 04:49:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 543 states and 670 transitions. [2024-11-25 04:49:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2024-11-25 04:49:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 04:49:07,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 563 states and 691 transitions. [2024-11-25 04:49:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 691 transitions. [2024-11-25 04:49:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 04:49:07,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-11-25 04:49:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-11-25 04:49:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 04:49:10,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 772 states and 931 transitions. [2024-11-25 04:49:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 931 transitions. [2024-11-25 04:49:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 04:49:12,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 826 states and 992 transitions. [2024-11-25 04:49:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 992 transitions. [2024-11-25 04:49:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 04:49:15,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:15,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 843 states and 1011 transitions. [2024-11-25 04:49:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1011 transitions. [2024-11-25 04:49:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 04:49:17,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 845 states and 1012 transitions. [2024-11-25 04:49:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1012 transitions. [2024-11-25 04:49:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 04:49:17,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 858 states and 1027 transitions. [2024-11-25 04:49:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1027 transitions. [2024-11-25 04:49:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 04:49:18,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:49:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 872 states and 1044 transitions. [2024-11-25 04:49:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1044 transitions. [2024-11-25 04:49:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 04:49:19,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 04:49:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 893 states and 1063 transitions. [2024-11-25 04:49:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1063 transitions. [2024-11-25 04:49:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 04:49:19,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:49:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 923 states and 1096 transitions. [2024-11-25 04:49:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1096 transitions. [2024-11-25 04:49:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 04:49:21,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 04:49:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-11-25 04:49:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-11-25 04:49:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 04:49:21,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 967 states and 1142 transitions. [2024-11-25 04:49:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1142 transitions. [2024-11-25 04:49:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 04:49:22,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 04:49:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1013 states and 1195 transitions. [2024-11-25 04:49:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1195 transitions. [2024-11-25 04:49:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 04:49:23,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 04:49:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1014 states and 1195 transitions. [2024-11-25 04:49:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1195 transitions. [2024-11-25 04:49:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 04:49:24,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:24,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1085 states and 1282 transitions. [2024-11-25 04:49:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1282 transitions. [2024-11-25 04:49:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-25 04:49:27,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 04:49:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1086 states and 1282 transitions. [2024-11-25 04:49:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1282 transitions. [2024-11-25 04:49:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 04:49:27,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:49:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1179 states and 1397 transitions. [2024-11-25 04:49:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1397 transitions. [2024-11-25 04:49:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 04:49:31,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:49:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1181 states and 1400 transitions. [2024-11-25 04:49:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1400 transitions. [2024-11-25 04:49:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 04:49:31,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 04:49:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1206 states and 1427 transitions. [2024-11-25 04:49:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1427 transitions. [2024-11-25 04:49:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-25 04:49:32,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:49:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1233 states and 1457 transitions. [2024-11-25 04:49:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1457 transitions. [2024-11-25 04:49:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-25 04:49:34,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 04:49:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1260 states and 1487 transitions. [2024-11-25 04:49:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1487 transitions. [2024-11-25 04:49:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 04:49:35,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:49:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1289 states and 1518 transitions. [2024-11-25 04:49:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1518 transitions. [2024-11-25 04:49:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 04:49:36,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1305 states and 1535 transitions. [2024-11-25 04:49:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1535 transitions. [2024-11-25 04:49:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 04:49:38,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1310 states and 1539 transitions. [2024-11-25 04:49:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1539 transitions. [2024-11-25 04:49:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 04:49:38,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 04:49:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1342 states and 1572 transitions. [2024-11-25 04:49:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1572 transitions. [2024-11-25 04:49:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 04:49:42,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1356 states and 1590 transitions. [2024-11-25 04:49:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1590 transitions. [2024-11-25 04:49:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 04:49:43,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 04:49:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1357 states and 1591 transitions. [2024-11-25 04:49:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1591 transitions. [2024-11-25 04:49:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 04:49:44,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 04:49:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1398 states and 1634 transitions. [2024-11-25 04:49:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1634 transitions. [2024-11-25 04:49:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 04:49:46,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 04:49:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1558 states and 1818 transitions. [2024-11-25 04:49:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1818 transitions. [2024-11-25 04:49:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-25 04:49:52,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1588 states and 1863 transitions. [2024-11-25 04:49:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1863 transitions. [2024-11-25 04:49:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-25 04:49:54,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1589 states and 1863 transitions. [2024-11-25 04:49:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1863 transitions. [2024-11-25 04:49:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 04:49:55,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 04:49:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1654 states and 1946 transitions. [2024-11-25 04:49:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1946 transitions. [2024-11-25 04:49:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 04:49:57,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:49:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1675 states and 1969 transitions. [2024-11-25 04:49:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1969 transitions. [2024-11-25 04:49:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 04:49:59,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 04:50:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1688 states and 1984 transitions. [2024-11-25 04:50:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1984 transitions. [2024-11-25 04:50:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 04:50:00,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:50:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1740 states and 2051 transitions. [2024-11-25 04:50:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2051 transitions. [2024-11-25 04:50:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 04:50:02,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:50:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1814 states and 2132 transitions. [2024-11-25 04:50:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2132 transitions. [2024-11-25 04:50:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 04:50:06,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 04:50:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1820 states and 2139 transitions. [2024-11-25 04:50:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2139 transitions. [2024-11-25 04:50:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-25 04:50:07,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 04:50:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1829 states and 2152 transitions. [2024-11-25 04:50:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2152 transitions. [2024-11-25 04:50:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 04:50:08,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 04:50:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1873 states and 2203 transitions. [2024-11-25 04:50:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2203 transitions. [2024-11-25 04:50:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 04:50:10,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 04:50:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 1874 states and 2205 transitions. [2024-11-25 04:50:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2205 transitions. [2024-11-25 04:50:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 04:50:11,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1887 states and 2219 transitions. [2024-11-25 04:50:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2219 transitions. [2024-11-25 04:50:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 04:50:12,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 04:50:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 1930 states and 2263 transitions. [2024-11-25 04:50:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2263 transitions. [2024-11-25 04:50:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 04:50:15,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 04:50:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2026 states and 2364 transitions. [2024-11-25 04:50:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2364 transitions. [2024-11-25 04:50:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 04:50:19,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 145 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 04:50:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2043 states and 2381 transitions. [2024-11-25 04:50:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2381 transitions. [2024-11-25 04:50:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 04:50:20,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:50:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2056 states and 2396 transitions. [2024-11-25 04:50:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2396 transitions. [2024-11-25 04:50:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 04:50:20,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:50:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2073 states and 2413 transitions. [2024-11-25 04:50:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2413 transitions. [2024-11-25 04:50:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-25 04:50:21,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-25 04:50:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2086 states and 2427 transitions. [2024-11-25 04:50:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2427 transitions. [2024-11-25 04:50:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 04:50:22,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 04:50:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2115 states and 2464 transitions. [2024-11-25 04:50:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2464 transitions. [2024-11-25 04:50:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 04:50:24,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 04:50:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2144 states and 2499 transitions. [2024-11-25 04:50:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2499 transitions. [2024-11-25 04:50:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 04:50:30,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 04:50:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2146 states and 2509 transitions. [2024-11-25 04:50:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2509 transitions. [2024-11-25 04:50:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 04:50:32,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 04:50:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2174 states and 2538 transitions. [2024-11-25 04:50:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2538 transitions. [2024-11-25 04:50:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 04:50:33,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 04:50:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2176 states and 2555 transitions. [2024-11-25 04:50:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2555 transitions. [2024-11-25 04:50:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 04:50:35,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 04:50:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2204 states and 2583 transitions. [2024-11-25 04:50:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2583 transitions. [2024-11-25 04:50:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 04:50:36,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 04:50:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2206 states and 2590 transitions. [2024-11-25 04:50:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2590 transitions. [2024-11-25 04:50:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 04:50:38,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 04:50:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2234 states and 2617 transitions. [2024-11-25 04:50:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2617 transitions. [2024-11-25 04:50:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 04:50:39,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:50:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2296 states and 2690 transitions. [2024-11-25 04:50:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2690 transitions. [2024-11-25 04:50:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 04:50:44,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 04:50:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2322 states and 2717 transitions. [2024-11-25 04:50:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2717 transitions. [2024-11-25 04:50:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 04:50:45,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 04:50:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2329 states and 2724 transitions. [2024-11-25 04:50:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2724 transitions. [2024-11-25 04:50:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-25 04:50:47,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:47,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 04:50:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2338 states and 2732 transitions. [2024-11-25 04:50:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2732 transitions. [2024-11-25 04:50:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 04:50:47,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 04:50:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2446 states and 2863 transitions. [2024-11-25 04:50:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2863 transitions. [2024-11-25 04:50:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 04:50:51,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:50:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2486 states and 2920 transitions. [2024-11-25 04:50:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2920 transitions. [2024-11-25 04:50:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 04:50:56,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:50:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2495 states and 2931 transitions. [2024-11-25 04:50:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2931 transitions. [2024-11-25 04:50:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 04:50:57,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:50:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2504 states and 2942 transitions. [2024-11-25 04:50:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 2942 transitions. [2024-11-25 04:50:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 04:50:58,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 04:50:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2505 states and 2946 transitions. [2024-11-25 04:50:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2946 transitions. [2024-11-25 04:50:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 04:50:59,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 04:51:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2506 states and 2946 transitions. [2024-11-25 04:51:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2946 transitions. [2024-11-25 04:51:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 04:51:01,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 04:51:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2522 states and 2965 transitions. [2024-11-25 04:51:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 2965 transitions. [2024-11-25 04:51:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 04:51:03,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 04:51:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2523 states and 2967 transitions. [2024-11-25 04:51:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2967 transitions. [2024-11-25 04:51:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:04,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:04,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 04:51:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2574 states and 3026 transitions. [2024-11-25 04:51:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3026 transitions. [2024-11-25 04:51:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:07,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-25 04:51:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 2610 states and 3064 transitions. [2024-11-25 04:51:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3064 transitions. [2024-11-25 04:51:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:10,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 2647 states and 3117 transitions. [2024-11-25 04:51:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3117 transitions. [2024-11-25 04:51:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:14,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 2673 states and 3146 transitions. [2024-11-25 04:51:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3146 transitions. [2024-11-25 04:51:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:16,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 2690 states and 3167 transitions. [2024-11-25 04:51:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3167 transitions. [2024-11-25 04:51:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:18,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 2699 states and 3176 transitions. [2024-11-25 04:51:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3176 transitions. [2024-11-25 04:51:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:19,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 2715 states and 3192 transitions. [2024-11-25 04:51:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3192 transitions. [2024-11-25 04:51:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:20,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2731 states and 3208 transitions. [2024-11-25 04:51:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3208 transitions. [2024-11-25 04:51:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 04:51:21,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 04:51:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2732 states and 3208 transitions. [2024-11-25 04:51:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3208 transitions. [2024-11-25 04:51:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 04:51:21,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 04:51:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 2750 states and 3230 transitions. [2024-11-25 04:51:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3230 transitions. [2024-11-25 04:51:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 04:51:24,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 04:51:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2766 states and 3245 transitions. [2024-11-25 04:51:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3245 transitions. [2024-11-25 04:51:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 04:51:25,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 04:51:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 2780 states and 3258 transitions. [2024-11-25 04:51:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3258 transitions. [2024-11-25 04:51:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 04:51:25,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 04:51:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 2790 states and 3271 transitions. [2024-11-25 04:51:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3271 transitions. [2024-11-25 04:51:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 04:51:27,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 2820 states and 3307 transitions. [2024-11-25 04:51:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3307 transitions. [2024-11-25 04:51:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 04:51:29,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 2847 states and 3335 transitions. [2024-11-25 04:51:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3335 transitions. [2024-11-25 04:51:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 04:51:31,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 2900 states and 3396 transitions. [2024-11-25 04:51:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3396 transitions. [2024-11-25 04:51:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 04:51:36,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 2958 states and 3462 transitions. [2024-11-25 04:51:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3462 transitions. [2024-11-25 04:51:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 04:51:40,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 04:51:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 2964 states and 3469 transitions. [2024-11-25 04:51:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3469 transitions. [2024-11-25 04:51:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 04:51:40,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 04:51:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 2980 states and 3487 transitions. [2024-11-25 04:51:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 3487 transitions. [2024-11-25 04:51:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 04:51:41,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 04:51:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 2996 states and 3503 transitions. [2024-11-25 04:51:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3503 transitions. [2024-11-25 04:51:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 04:51:42,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 04:51:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3016 states and 3525 transitions. [2024-11-25 04:51:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3525 transitions. [2024-11-25 04:51:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 04:51:44,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3055 states and 3565 transitions. [2024-11-25 04:51:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3565 transitions. [2024-11-25 04:51:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-25 04:51:48,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-25 04:51:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3071 states and 3581 transitions. [2024-11-25 04:51:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3581 transitions. [2024-11-25 04:51:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 04:51:49,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3080 states and 3591 transitions. [2024-11-25 04:51:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3591 transitions. [2024-11-25 04:51:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 04:51:51,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-25 04:51:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3092 states and 3603 transitions. [2024-11-25 04:51:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3603 transitions. [2024-11-25 04:51:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 04:51:52,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-25 04:51:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3106 states and 3619 transitions. [2024-11-25 04:51:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3619 transitions. [2024-11-25 04:51:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 04:51:53,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:51:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3127 states and 3642 transitions. [2024-11-25 04:51:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 3642 transitions. [2024-11-25 04:51:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 04:51:55,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-25 04:51:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3147 states and 3661 transitions. [2024-11-25 04:51:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3661 transitions. [2024-11-25 04:51:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 04:51:57,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 04:51:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3150 states and 3665 transitions. [2024-11-25 04:51:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 3665 transitions. [2024-11-25 04:51:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 04:51:57,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 04:52:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3277 states and 3806 transitions. [2024-11-25 04:52:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 3806 transitions. [2024-11-25 04:52:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-25 04:52:03,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 205 proven. 183 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:52:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3322 states and 3858 transitions. [2024-11-25 04:52:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 3858 transitions. [2024-11-25 04:52:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-25 04:52:07,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-25 04:52:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3431 states and 3978 transitions. [2024-11-25 04:52:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 3978 transitions. [2024-11-25 04:52:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 04:52:12,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:52:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4042 states to 3481 states and 4042 transitions. [2024-11-25 04:52:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4042 transitions. [2024-11-25 04:52:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 04:52:18,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:52:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 3490 states and 4052 transitions. [2024-11-25 04:52:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4052 transitions. [2024-11-25 04:52:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 04:52:20,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:52:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 3499 states and 4063 transitions. [2024-11-25 04:52:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4063 transitions. [2024-11-25 04:52:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 04:52:21,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 04:52:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 3609 states and 4180 transitions. [2024-11-25 04:52:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4180 transitions. [2024-11-25 04:52:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-25 04:52:28,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 369 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-25 04:52:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 3627 states and 4202 transitions. [2024-11-25 04:52:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 4202 transitions. [2024-11-25 04:52:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-25 04:52:31,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 04:52:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 3661 states and 4252 transitions. [2024-11-25 04:52:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4252 transitions. [2024-11-25 04:52:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 04:52:37,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 04:52:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 3666 states and 4261 transitions. [2024-11-25 04:52:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4261 transitions. [2024-11-25 04:52:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 04:52:39,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-25 04:52:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 3675 states and 4274 transitions. [2024-11-25 04:52:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4274 transitions. [2024-11-25 04:52:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 04:52:42,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-25 04:52:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 3681 states and 4279 transitions. [2024-11-25 04:52:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4279 transitions. [2024-11-25 04:52:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 04:52:44,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 04:52:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 3724 states and 4322 transitions. [2024-11-25 04:52:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4322 transitions. [2024-11-25 04:52:52,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 04:52:52,924 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 149 iterations. [2024-11-25 04:52:52,933 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 04:53:43,181 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,182 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,182 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,182 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,183 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,183 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,183 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,184 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,184 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,184 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,185 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,185 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,185 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,186 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,186 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,186 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,186 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,187 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,187 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,187 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,187 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,187 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,188 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,188 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,188 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-25 04:53:43,188 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,189 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,189 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,189 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,189 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-25 04:53:43,189 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,190 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,190 INFO L75 FloydHoareUtils]: For program point L513(line 513) no Hoare annotation was computed. [2024-11-25 04:53:43,190 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,190 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,191 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,191 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,191 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,191 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,191 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,191 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,192 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,192 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,192 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,192 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,192 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,192 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,193 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,193 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,193 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 04:53:43,193 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,193 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 04:53:43,194 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,194 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,194 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,194 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,195 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,195 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,195 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,195 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 04:53:43,195 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,196 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,196 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,196 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,196 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,196 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,197 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,197 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,197 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,197 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 513) no Hoare annotation was computed. [2024-11-25 04:53:43,197 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,198 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 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 04:53:43,198 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,198 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,198 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 04:53:43,198 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse12 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (not .cse10)) (.cse2 (= 5 ~a16~0)) (.cse0 (<= 15 ~a8~0)) (.cse9 (= 14 ~a8~0)) (.cse3 (not .cse12)) (.cse8 (= ~a8~0 15)) (.cse1 (= ~a12~0 8)) (.cse11 (not .cse5)) (.cse4 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and (not (= ~a17~0 ~a7~0)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (not .cse1) .cse0) (and .cse6 (<= ~a16~0 4) .cse0) (and .cse6 .cse1 .cse3 .cse4 .cse7) (and (not .cse4) .cse0) (and (< 5 ~a16~0) .cse0) (and .cse6 (not (and .cse8 (= ~a20~0 ~a7~0))) .cse0) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse1 .cse9 .cse2 .cse3 .cse4) (and (not (and (= ~a7~0 0) .cse8)) .cse10 .cse0) (and .cse10 .cse8 (not .cse7)) (and .cse1 .cse9 .cse3 .cse11 .cse4 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8) (and .cse1 .cse11 .cse4 .cse12 .cse10 .cse7)))) [2024-11-25 04:53:43,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:53:43 ImpRootNode [2024-11-25 04:53:43,214 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:53:43,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:53:43,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:53:43,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:53:43,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:40" (3/4) ... [2024-11-25 04:53:43,218 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 04:53:43,236 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-25 04:53:43,237 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-25 04:53:43,241 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 04:53:43,242 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 04:53:43,396 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:53:43,396 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:53:43,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:53:43,400 INFO L158 Benchmark]: Toolchain (without parser) took 306686.77ms. Allocated memory was 117.4MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 91.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-25 04:53:43,400 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:53:43,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 833.40ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.4MB in the end (delta: 26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:53:43,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.22ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 58.9MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:53:43,402 INFO L158 Benchmark]: Boogie Preprocessor took 115.05ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:53:43,402 INFO L158 Benchmark]: RCFGBuilder took 2396.59ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 54.7MB in the beginning and 88.6MB in the end (delta: -33.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-11-25 04:53:43,404 INFO L158 Benchmark]: CodeCheck took 303015.59ms. Allocated memory was 184.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 88.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-25 04:53:43,405 INFO L158 Benchmark]: Witness Printer took 182.11ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:53:43,407 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: 252.7s, OverallIterations: 149, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528769 SdHoareTripleChecker+Valid, 1644.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526399 mSDsluCounter, 70696 SdHoareTripleChecker+Invalid, 1411.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60304 mSDsCounter, 93135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1109760 IncrementalHoareTripleChecker+Invalid, 1202895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93135 mSolverCounterUnsat, 10392 mSDtfsCounter, 1109760 mSolverCounterSat, 15.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189997 GetRequests, 181442 SyntacticMatches, 7235 SemanticMatches, 1320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152353 ImplicationChecksByTransitivity, 177.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 28391 NumberOfCodeBlocks, 28391 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 28243 ConstructedInterpolants, 0 QuantifiedInterpolants, 149599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 148 InterpolantComputations, 75 PerfectInterpolantSequences, 27611/33101 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: 513]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 833.40ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.4MB in the end (delta: 26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 134.22ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 58.9MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.05ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2396.59ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 54.7MB in the beginning and 88.6MB in the end (delta: -33.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * CodeCheck took 303015.59ms. Allocated memory was 184.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 88.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 182.11ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 04:53:43,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab8bb1b2-39fb-45fa-8ac3-7fb9768a3003/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE