./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-08 22:35:05,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:35:05,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:35:05,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:35:05,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:35:05,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:35:05,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:35:05,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:35:05,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:35:05,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:35:05,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:35:05,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:35:05,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:35:05,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:35:05,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:35:05,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:35:05,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:35:05,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:35:05,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:35:05,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:35:05,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:35:05,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:35:05,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:35:05,768 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:35:05,769 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:35:05,769 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:35:05,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:35:05,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:35:05,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:35:05,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:35:05,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:35:05,774 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:35:05,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:35:05,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk 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-08 22:35:06,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:35:06,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:35:06,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:35:06,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:35:06,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:35:06,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c Unable to find full path for "g++" [2024-11-08 22:35:08,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:35:08,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:35:08,317 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-08 22:35:08,335 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/data/38edad6a4/b0a4143a1816400090d065d2ac432d04/FLAG38bc87772 [2024-11-08 22:35:08,614 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/data/38edad6a4/b0a4143a1816400090d065d2ac432d04 [2024-11-08 22:35:08,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:35:08,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:35:08,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:08,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:35:08,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:35:08,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:08" (1/1) ... [2024-11-08 22:35:08,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfda390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:08, skipping insertion in model container [2024-11-08 22:35:08,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:08" (1/1) ... [2024-11-08 22:35:08,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:35:09,083 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_a21cdac5-91f1-4120-96a1-0a1741743f1f/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-08 22:35:09,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:09,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:35:09,297 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_a21cdac5-91f1-4120-96a1-0a1741743f1f/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-08 22:35:09,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:09,354 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:35:09,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09 WrapperNode [2024-11-08 22:35:09,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:09,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:09,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:35:09,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:35:09,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,454 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 22:35:09,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:09,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:35:09,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:35:09,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:35:09,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:35:09,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:35:09,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:35:09,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:35:09,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:35:09,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:35:09,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:35:09,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:35:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:35:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:35:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:35:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:35:09,683 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:35:09,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:35:10,784 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 22:35:10,784 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:35:11,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:35:11,065 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:35:11,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:11 BoogieIcfgContainer [2024-11-08 22:35:11,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:35:11,066 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:35:11,067 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:35:11,078 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:35:11,079 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:11" (1/1) ... [2024-11-08 22:35:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 22:35:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 22:35:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 22:35:11,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:11,780 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-08 22:35:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-08 22:35:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-08 22:35:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:35:12,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:12,719 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-08 22:35:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-08 22:35:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-08 22:35:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 22:35:12,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:13,034 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-08 22:35:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-08 22:35:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-08 22:35:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 22:35:13,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:13,644 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-08 22:35:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-08 22:35:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-08 22:35:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 22:35:14,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:14,714 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-08 22:35:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-08 22:35:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-08 22:35:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 22:35:14,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:15,039 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-08 22:35:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-08 22:35:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-08 22:35:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 22:35:15,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:15,365 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-08 22:35:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-08 22:35:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-08 22:35:15,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 22:35:15,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:15,972 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-08 22:35:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-08 22:35:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-08 22:35:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 22:35:16,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:16,337 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-08 22:35:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-08 22:35:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-08 22:35:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:35:16,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:16,814 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-08 22:35:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-08 22:35:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-08 22:35:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 22:35:17,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:17,513 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-08 22:35:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-08 22:35:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-08 22:35:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 22:35:17,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:17,861 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-08 22:35:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-08 22:35:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-08 22:35:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:35:18,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:18,438 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-08 22:35:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-08 22:35:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-08 22:35:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 22:35:18,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:18,933 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-08 22:35:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-08 22:35:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-08 22:35:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 22:35:19,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:19,636 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-08 22:35:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-08 22:35:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-08 22:35:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 22:35:20,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:20,398 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-08 22:35:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-08 22:35:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-08 22:35:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 22:35:20,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:20,616 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-08 22:35:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-08 22:35:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-08 22:35:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 22:35:20,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:20,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:21,128 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-08 22:35:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-08 22:35:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-08 22:35:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 22:35:21,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:21,926 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-08 22:35:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-08 22:35:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-08 22:35:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:35:22,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:22,416 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-08 22:35:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-08 22:35:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-08 22:35:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 22:35:22,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:23,024 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-08 22:35:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-08 22:35:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-08 22:35:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 22:35:23,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:23,384 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-08 22:35:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-08 22:35:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-08 22:35:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:35:24,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:24,254 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-08 22:35:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 363 states and 472 transitions. [2024-11-08 22:35:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2024-11-08 22:35:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:35:24,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 367 states and 477 transitions. [2024-11-08 22:35:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 477 transitions. [2024-11-08 22:35:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:35:25,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:35:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 381 states and 491 transitions. [2024-11-08 22:35:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-08 22:35:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:35:25,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:26,050 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-08 22:35:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 383 states and 495 transitions. [2024-11-08 22:35:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-11-08 22:35:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:35:26,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:26,597 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-08 22:35:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 402 states and 516 transitions. [2024-11-08 22:35:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 516 transitions. [2024-11-08 22:35:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 22:35:26,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:27,035 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-08 22:35:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 404 states and 518 transitions. [2024-11-08 22:35:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2024-11-08 22:35:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 22:35:27,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:27,333 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-08 22:35:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 418 states and 532 transitions. [2024-11-08 22:35:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 532 transitions. [2024-11-08 22:35:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 22:35:27,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:27,547 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-08 22:35:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 426 states and 543 transitions. [2024-11-08 22:35:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 543 transitions. [2024-11-08 22:35:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:35:27,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:27,847 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-08 22:35:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 466 states and 585 transitions. [2024-11-08 22:35:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 585 transitions. [2024-11-08 22:35:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:35:28,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:28,966 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-08 22:35:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 471 states and 590 transitions. [2024-11-08 22:35:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 590 transitions. [2024-11-08 22:35:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:35:29,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:29,408 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-08 22:35:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 476 states and 596 transitions. [2024-11-08 22:35:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 596 transitions. [2024-11-08 22:35:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 22:35:29,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:29,846 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-08 22:35:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 479 states and 600 transitions. [2024-11-08 22:35:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2024-11-08 22:35:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 22:35:30,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:30,443 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-08 22:35:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 481 states and 603 transitions. [2024-11-08 22:35:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2024-11-08 22:35:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 22:35:30,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:31,046 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-08 22:35:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 484 states and 606 transitions. [2024-11-08 22:35:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2024-11-08 22:35:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:35:31,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:31,457 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-08 22:35:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 534 states and 661 transitions. [2024-11-08 22:35:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 661 transitions. [2024-11-08 22:35:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:35:32,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:32,463 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-08 22:35:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 536 states and 662 transitions. [2024-11-08 22:35:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 662 transitions. [2024-11-08 22:35:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 22:35:32,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:32,953 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-08 22:35:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 539 states and 665 transitions. [2024-11-08 22:35:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2024-11-08 22:35:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 22:35:33,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:33,245 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-08 22:35:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 559 states and 686 transitions. [2024-11-08 22:35:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 686 transitions. [2024-11-08 22:35:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 22:35:33,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:33,961 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-08 22:35:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 699 states and 841 transitions. [2024-11-08 22:35:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 841 transitions. [2024-11-08 22:35:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 22:35:35,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:36,309 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-08 22:35:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 768 states and 926 transitions. [2024-11-08 22:35:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 926 transitions. [2024-11-08 22:35:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:35:37,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:38,249 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-08 22:35:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 822 states and 987 transitions. [2024-11-08 22:35:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 987 transitions. [2024-11-08 22:35:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:40,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:40,843 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-08 22:35:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 839 states and 1006 transitions. [2024-11-08 22:35:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1006 transitions. [2024-11-08 22:35:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:41,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:42,007 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-08 22:35:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 841 states and 1007 transitions. [2024-11-08 22:35:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1007 transitions. [2024-11-08 22:35:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:35:42,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:42,775 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-08 22:35:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 854 states and 1022 transitions. [2024-11-08 22:35:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1022 transitions. [2024-11-08 22:35:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 22:35:43,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:43,368 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-08 22:35:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 868 states and 1039 transitions. [2024-11-08 22:35:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1039 transitions. [2024-11-08 22:35:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:35:43,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:43,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:44,057 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-08 22:35:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 889 states and 1058 transitions. [2024-11-08 22:35:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1058 transitions. [2024-11-08 22:35:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:35:44,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:44,567 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-08 22:35:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 919 states and 1091 transitions. [2024-11-08 22:35:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1091 transitions. [2024-11-08 22:35:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:35:45,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:45,898 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-08 22:35:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 933 states and 1104 transitions. [2024-11-08 22:35:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1104 transitions. [2024-11-08 22:35:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:35:46,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:46,748 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-08 22:35:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 963 states and 1138 transitions. [2024-11-08 22:35:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2024-11-08 22:35:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 22:35:47,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:48,039 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-08 22:35:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1009 states and 1191 transitions. [2024-11-08 22:35:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1191 transitions. [2024-11-08 22:35:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 22:35:48,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:48,748 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-08 22:35:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1010 states and 1191 transitions. [2024-11-08 22:35:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1191 transitions. [2024-11-08 22:35:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:35:48,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:49,264 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-08 22:35:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1081 states and 1278 transitions. [2024-11-08 22:35:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1278 transitions. [2024-11-08 22:35:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 22:35:51,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:51,546 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-08 22:35:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1082 states and 1278 transitions. [2024-11-08 22:35:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1278 transitions. [2024-11-08 22:35:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:35:51,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:52,394 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-08 22:35:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1175 states and 1393 transitions. [2024-11-08 22:35:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1393 transitions. [2024-11-08 22:35:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:35:54,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:55,151 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-08 22:35:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1177 states and 1396 transitions. [2024-11-08 22:35:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1396 transitions. [2024-11-08 22:35:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:35:55,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:55,601 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-08 22:35:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1202 states and 1423 transitions. [2024-11-08 22:35:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1423 transitions. [2024-11-08 22:35:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:35:56,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:56,477 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-08 22:35:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1229 states and 1453 transitions. [2024-11-08 22:35:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1453 transitions. [2024-11-08 22:35:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 22:35:57,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:57,717 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-08 22:35:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1256 states and 1483 transitions. [2024-11-08 22:35:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1483 transitions. [2024-11-08 22:35:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:35:58,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:58,909 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-08 22:35:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1285 states and 1514 transitions. [2024-11-08 22:35:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1514 transitions. [2024-11-08 22:35:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:35:59,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:00,113 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-08 22:36:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1301 states and 1531 transitions. [2024-11-08 22:36:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1531 transitions. [2024-11-08 22:36:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:36:00,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:01,308 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-08 22:36:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1306 states and 1535 transitions. [2024-11-08 22:36:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1535 transitions. [2024-11-08 22:36:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:36:01,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:02,371 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-08 22:36:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1338 states and 1568 transitions. [2024-11-08 22:36:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1568 transitions. [2024-11-08 22:36:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:36:04,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:04,793 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-08 22:36:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1352 states and 1586 transitions. [2024-11-08 22:36:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1586 transitions. [2024-11-08 22:36:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:36:05,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:05,877 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-08 22:36:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1380 states and 1617 transitions. [2024-11-08 22:36:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1617 transitions. [2024-11-08 22:36:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:36:07,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:07,439 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-08 22:36:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1393 states and 1628 transitions. [2024-11-08 22:36:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1628 transitions. [2024-11-08 22:36:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:36:08,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:09,131 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-08 22:36:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1553 states and 1810 transitions. [2024-11-08 22:36:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1810 transitions. [2024-11-08 22:36:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 22:36:13,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:14,106 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-08 22:36:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1583 states and 1855 transitions. [2024-11-08 22:36:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1855 transitions. [2024-11-08 22:36:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 22:36:15,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:15,684 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-08 22:36:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1584 states and 1855 transitions. [2024-11-08 22:36:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1855 transitions. [2024-11-08 22:36:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:36:16,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:16,508 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-08 22:36:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1649 states and 1938 transitions. [2024-11-08 22:36:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1938 transitions. [2024-11-08 22:36:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 22:36:18,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:18,200 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-08 22:36:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1650 states and 1938 transitions. [2024-11-08 22:36:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1938 transitions. [2024-11-08 22:36:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:36:18,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:18,787 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-08 22:36:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1663 states and 1953 transitions. [2024-11-08 22:36:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1953 transitions. [2024-11-08 22:36:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:19,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:20,216 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-08 22:36:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 1715 states and 2020 transitions. [2024-11-08 22:36:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2020 transitions. [2024-11-08 22:36:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:22,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:22,486 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-08 22:36:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1789 states and 2101 transitions. [2024-11-08 22:36:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2101 transitions. [2024-11-08 22:36:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:25,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:25,903 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-08 22:36:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1795 states and 2108 transitions. [2024-11-08 22:36:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2108 transitions. [2024-11-08 22:36:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 22:36:26,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:26,249 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-08 22:36:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 1804 states and 2121 transitions. [2024-11-08 22:36:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2121 transitions. [2024-11-08 22:36:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:36:26,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:26,870 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-08 22:36:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1839 states and 2163 transitions. [2024-11-08 22:36:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2163 transitions. [2024-11-08 22:36:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:36:28,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:28,767 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-08 22:36:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1849 states and 2174 transitions. [2024-11-08 22:36:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2174 transitions. [2024-11-08 22:36:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:36:29,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:30,277 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-08 22:36:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1862 states and 2188 transitions. [2024-11-08 22:36:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2188 transitions. [2024-11-08 22:36:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 22:36:31,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:31,360 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-08 22:36:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1896 states and 2224 transitions. [2024-11-08 22:36:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2224 transitions. [2024-11-08 22:36:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 22:36:33,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:33,749 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-08 22:36:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1994 states and 2330 transitions. [2024-11-08 22:36:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2330 transitions. [2024-11-08 22:36:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:36:36,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:37,009 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-08 22:36:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2011 states and 2347 transitions. [2024-11-08 22:36:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2347 transitions. [2024-11-08 22:36:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 22:36:37,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:37,724 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-08 22:36:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2024 states and 2362 transitions. [2024-11-08 22:36:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2362 transitions. [2024-11-08 22:36:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 22:36:38,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:38,311 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-08 22:36:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2041 states and 2379 transitions. [2024-11-08 22:36:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2379 transitions. [2024-11-08 22:36:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 22:36:38,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:38,927 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-08 22:36:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2063 states and 2401 transitions. [2024-11-08 22:36:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2401 transitions. [2024-11-08 22:36:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:36:39,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:40,124 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-08 22:36:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2090 states and 2430 transitions. [2024-11-08 22:36:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2430 transitions. [2024-11-08 22:36:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:36:41,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:41,813 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-08 22:36:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2119 states and 2465 transitions. [2024-11-08 22:36:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2465 transitions. [2024-11-08 22:36:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 22:36:43,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:43,666 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-08 22:36:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2121 states and 2474 transitions. [2024-11-08 22:36:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2474 transitions. [2024-11-08 22:36:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 22:36:45,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:45,336 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-08 22:36:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2149 states and 2503 transitions. [2024-11-08 22:36:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2503 transitions. [2024-11-08 22:36:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 22:36:46,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:46,704 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-08 22:36:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2151 states and 2519 transitions. [2024-11-08 22:36:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2519 transitions. [2024-11-08 22:36:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 22:36:47,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:48,059 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-08 22:36:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2179 states and 2547 transitions. [2024-11-08 22:36:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2547 transitions. [2024-11-08 22:36:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 22:36:49,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:49,392 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-08 22:36:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2181 states and 2554 transitions. [2024-11-08 22:36:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2554 transitions. [2024-11-08 22:36:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 22:36:50,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:50,643 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-08 22:36:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2209 states and 2581 transitions. [2024-11-08 22:36:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2581 transitions. [2024-11-08 22:36:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 22:36:51,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 178 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:36:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2295 states and 2683 transitions. [2024-11-08 22:36:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2683 transitions. [2024-11-08 22:36:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 22:36:56,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:57,101 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-08 22:36:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2323 states and 2714 transitions. [2024-11-08 22:36:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2714 transitions. [2024-11-08 22:36:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 22:36:58,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:59,178 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-08 22:37:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2349 states and 2741 transitions. [2024-11-08 22:37:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2741 transitions. [2024-11-08 22:37:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 22:37:00,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:00,723 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-08 22:37:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2358 states and 2749 transitions. [2024-11-08 22:37:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2749 transitions. [2024-11-08 22:37:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 22:37:01,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:01,641 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-08 22:37:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2466 states and 2869 transitions. [2024-11-08 22:37:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2869 transitions. [2024-11-08 22:37:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 22:37:04,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:04,838 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-08 22:37:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2503 states and 2916 transitions. [2024-11-08 22:37:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2916 transitions. [2024-11-08 22:37:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 22:37:07,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:07,670 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-08 22:37:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2527 states and 2942 transitions. [2024-11-08 22:37:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2942 transitions. [2024-11-08 22:37:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 22:37:09,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:09,452 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-08 22:37:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2552 states and 2975 transitions. [2024-11-08 22:37:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 2975 transitions. [2024-11-08 22:37:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 22:37:10,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:11,254 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-08 22:37:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2561 states and 2987 transitions. [2024-11-08 22:37:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 2987 transitions. [2024-11-08 22:37:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:37:11,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:12,220 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-08 22:37:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2563 states and 2993 transitions. [2024-11-08 22:37:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 2993 transitions. [2024-11-08 22:37:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:37:13,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:14,088 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-08 22:37:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2568 states and 2999 transitions. [2024-11-08 22:37:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 2999 transitions. [2024-11-08 22:37:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:37:14,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:14,564 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-08 22:37:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 2584 states and 3020 transitions. [2024-11-08 22:37:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3020 transitions. [2024-11-08 22:37:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:37:16,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:16,360 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-08 22:37:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 2585 states and 3020 transitions. [2024-11-08 22:37:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3020 transitions. [2024-11-08 22:37:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:16,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:17,392 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-08 22:37:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 2636 states and 3079 transitions. [2024-11-08 22:37:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3079 transitions. [2024-11-08 22:37:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:19,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:19,339 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-08 22:37:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 2672 states and 3117 transitions. [2024-11-08 22:37:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3117 transitions. [2024-11-08 22:37:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:21,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:21,706 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-08 22:37:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 2734 states and 3199 transitions. [2024-11-08 22:37:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3199 transitions. [2024-11-08 22:37:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:26,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:27,055 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-08 22:37:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 2751 states and 3216 transitions. [2024-11-08 22:37:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3216 transitions. [2024-11-08 22:37:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:27,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:27,841 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-08 22:37:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 2761 states and 3227 transitions. [2024-11-08 22:37:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3227 transitions. [2024-11-08 22:37:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:28,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:28,964 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-08 22:37:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 2777 states and 3244 transitions. [2024-11-08 22:37:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3244 transitions. [2024-11-08 22:37:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:37:29,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:29,757 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-08 22:37:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 2794 states and 3261 transitions. [2024-11-08 22:37:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3261 transitions. [2024-11-08 22:37:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:37:30,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:30,559 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-08 22:37:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 2796 states and 3265 transitions. [2024-11-08 22:37:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3265 transitions. [2024-11-08 22:37:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:37:31,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:31,922 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-08 22:37:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 2822 states and 3295 transitions. [2024-11-08 22:37:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3295 transitions. [2024-11-08 22:37:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:37:34,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:34,276 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-08 22:37:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 2836 states and 3308 transitions. [2024-11-08 22:37:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3308 transitions. [2024-11-08 22:37:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:37:34,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:35,216 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-08 22:37:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 2866 states and 3344 transitions. [2024-11-08 22:37:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3344 transitions. [2024-11-08 22:37:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:37:37,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:37,605 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-08 22:37:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 2893 states and 3372 transitions. [2024-11-08 22:37:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3372 transitions. [2024-11-08 22:37:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:37:39,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:37:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 2904 states and 3384 transitions. [2024-11-08 22:37:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3384 transitions. [2024-11-08 22:37:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 22:37:40,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:41,318 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-08 22:37:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 2936 states and 3424 transitions. [2024-11-08 22:37:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3424 transitions. [2024-11-08 22:37:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:37:44,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:45,472 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-08 22:37:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 2994 states and 3490 transitions. [2024-11-08 22:37:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3490 transitions. [2024-11-08 22:37:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 22:37:47,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:48,097 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-08 22:37:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3000 states and 3497 transitions. [2024-11-08 22:37:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 3497 transitions. [2024-11-08 22:37:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:37:48,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:49,228 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-08 22:37:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3039 states and 3537 transitions. [2024-11-08 22:37:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 3537 transitions. [2024-11-08 22:37:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:37:52,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:52,529 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-08 22:37:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3055 states and 3555 transitions. [2024-11-08 22:37:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3555 transitions. [2024-11-08 22:37:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:37:53,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:53,537 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-08 22:37:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3071 states and 3571 transitions. [2024-11-08 22:37:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3571 transitions. [2024-11-08 22:37:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:37:54,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:54,301 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-08 22:37:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3091 states and 3593 transitions. [2024-11-08 22:37:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3593 transitions. [2024-11-08 22:37:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 22:37:55,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:55,814 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-08 22:37:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3107 states and 3609 transitions. [2024-11-08 22:37:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3609 transitions. [2024-11-08 22:37:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 22:37:56,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 22:37:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3125 states and 3628 transitions. [2024-11-08 22:37:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3628 transitions. [2024-11-08 22:37:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 22:37:57,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 22:37:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:37:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3136 states and 3639 transitions. [2024-11-08 22:37:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3639 transitions. [2024-11-08 22:37:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 22:37:58,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:37:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:37:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:37:59,064 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-08 22:38:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3150 states and 3654 transitions. [2024-11-08 22:38:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 3654 transitions. [2024-11-08 22:38:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 22:38:00,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:00,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:00,996 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-08 22:38:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3162 states and 3666 transitions. [2024-11-08 22:38:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3666 transitions. [2024-11-08 22:38:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 22:38:01,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:01,827 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-08 22:38:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3176 states and 3682 transitions. [2024-11-08 22:38:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 3682 transitions. [2024-11-08 22:38:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 22:38:03,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:03,645 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-08 22:38:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3213 states and 3720 transitions. [2024-11-08 22:38:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 3720 transitions. [2024-11-08 22:38:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 22:38:06,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:06,249 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-08 22:38:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3233 states and 3739 transitions. [2024-11-08 22:38:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 3739 transitions. [2024-11-08 22:38:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 22:38:07,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:08,082 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-08 22:38:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3236 states and 3743 transitions. [2024-11-08 22:38:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 3743 transitions. [2024-11-08 22:38:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 22:38:08,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:09,262 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-08 22:38:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3363 states and 3883 transitions. [2024-11-08 22:38:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 3883 transitions. [2024-11-08 22:38:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-08 22:38:13,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:13,995 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-08 22:38:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3390 states and 3916 transitions. [2024-11-08 22:38:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 3916 transitions. [2024-11-08 22:38:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-08 22:38:16,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:17,154 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-08 22:38:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 3508 states and 4047 transitions. [2024-11-08 22:38:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 4047 transitions. [2024-11-08 22:38:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 22:38:22,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:23,089 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-08 22:38:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 3548 states and 4098 transitions. [2024-11-08 22:38:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 4098 transitions. [2024-11-08 22:38:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 22:38:27,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:27,665 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-08 22:38:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 3558 states and 4111 transitions. [2024-11-08 22:38:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4111 transitions. [2024-11-08 22:38:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 22:38:29,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:29,819 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-08 22:38:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 3567 states and 4121 transitions. [2024-11-08 22:38:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4121 transitions. [2024-11-08 22:38:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 22:38:30,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:31,198 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-08 22:38:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 3576 states and 4131 transitions. [2024-11-08 22:38:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 4131 transitions. [2024-11-08 22:38:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 22:38:32,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:33,547 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-08 22:38:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 3686 states and 4248 transitions. [2024-11-08 22:38:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4248 transitions. [2024-11-08 22:38:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-08 22:38:39,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:39,827 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-08 22:38:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 3704 states and 4270 transitions. [2024-11-08 22:38:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 4270 transitions. [2024-11-08 22:38:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-08 22:38:42,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,028 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-08 22:38:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 3738 states and 4321 transitions. [2024-11-08 22:38:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4321 transitions. [2024-11-08 22:38:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-08 22:38:49,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:49,310 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-08 22:38:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 3743 states and 4330 transitions. [2024-11-08 22:38:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 4330 transitions. [2024-11-08 22:38:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 22:38:50,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:51,033 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-08 22:38:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 3752 states and 4343 transitions. [2024-11-08 22:38:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 4343 transitions. [2024-11-08 22:38:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 22:38:54,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:55,755 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-08 22:39:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:39:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 3798 states and 4395 transitions. [2024-11-08 22:39:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 4395 transitions. [2024-11-08 22:39:03,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 22:39:03,924 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 150 iterations. [2024-11-08 22:39:03,933 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 22:39:52,446 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,447 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-08 22:39:52,447 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-08 22:39:52,447 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-08 22:39:52,448 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,448 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,448 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-08 22:39:52,449 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-08 22:39:52,449 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,449 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-08 22:39:52,449 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,450 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-08 22:39:52,450 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-08 22:39:52,450 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-08 22:39:52,451 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-08 22:39:52,451 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-08 22:39:52,451 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-08 22:39:52,451 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,452 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-08 22:39:52,452 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-08 22:39:52,452 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-08 22:39:52,452 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-08 22:39:52,453 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-08 22:39:52,453 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,453 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-08 22:39:52,453 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-08 22:39:52,454 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,454 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-08 22:39:52,454 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,454 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-08 22:39:52,455 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-08 22:39:52,455 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-08 22:39:52,455 INFO L75 FloydHoareUtils]: For program point L513(line 513) no Hoare annotation was computed. [2024-11-08 22:39:52,455 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,456 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,456 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-08 22:39:52,456 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-08 22:39:52,456 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-08 22:39:52,457 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,457 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-08 22:39:52,457 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-08 22:39:52,458 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,458 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,458 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-08 22:39:52,458 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-08 22:39:52,459 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-08 22:39:52,459 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,459 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-08 22:39:52,459 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-08 22:39:52,460 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 22:39:52,460 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,460 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-08 22:39:52,460 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-08 22:39:52,460 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,461 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-08 22:39:52,461 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,461 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-08 22:39:52,461 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-08 22:39:52,461 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-08 22:39:52,461 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 22:39:52,462 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-08 22:39:52,462 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,462 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,462 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-08 22:39:52,462 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,462 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-08 22:39:52,463 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-08 22:39:52,463 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-08 22:39:52,463 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-08 22:39:52,463 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 513) no Hoare annotation was computed. [2024-11-08 22:39:52,464 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-08 22:39:52,464 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,464 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-08 22:39:52,465 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-08 22:39:52,465 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-08 22:39:52,465 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-08 22:39:52,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:39:52 ImpRootNode [2024-11-08 22:39:52,480 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:39:52,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:39:52,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:39:52,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:39:52,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:11" (3/4) ... [2024-11-08 22:39:52,484 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 22:39:52,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-08 22:39:52,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 22:39:52,501 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 22:39:52,502 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 22:39:52,706 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:39:52,707 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 22:39:52,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:39:52,708 INFO L158 Benchmark]: Toolchain (without parser) took 284089.35ms. Allocated memory was 138.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 95.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 725.9MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,709 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 138.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:39:52,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.73ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 94.8MB in the beginning and 155.4MB in the end (delta: -60.6MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.11ms. Allocated memory is still 188.7MB. Free memory was 155.4MB in the beginning and 149.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,711 INFO L158 Benchmark]: Boogie Preprocessor took 60.39ms. Allocated memory is still 188.7MB. Free memory was 149.2MB in the beginning and 145.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,711 INFO L158 Benchmark]: RCFGBuilder took 1549.69ms. Allocated memory is still 188.7MB. Free memory was 145.0MB in the beginning and 136.5MB in the end (delta: 8.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,712 INFO L158 Benchmark]: CodeCheck took 281413.71ms. Allocated memory was 188.7MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 136.5MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 701.5MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,712 INFO L158 Benchmark]: Witness Printer took 226.47ms. Allocated memory is still 4.6GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:39:52,714 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: 232.8s, OverallIterations: 150, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538512 SdHoareTripleChecker+Valid, 1409.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536125 mSDsluCounter, 70639 SdHoareTripleChecker+Invalid, 1216.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60192 mSDsCounter, 93672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1130081 IncrementalHoareTripleChecker+Invalid, 1223753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93672 mSolverCounterUnsat, 10447 mSDtfsCounter, 1130081 mSolverCounterSat, 10.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191871 GetRequests, 183058 SyntacticMatches, 7489 SemanticMatches, 1324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169660 ImplicationChecksByTransitivity, 159.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 28636 NumberOfCodeBlocks, 28636 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 28487 ConstructedInterpolants, 0 QuantifiedInterpolants, 152849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 149 InterpolantComputations, 72 PerfectInterpolantSequences, 27792/33680 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 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.53ms. Allocated memory is still 138.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.73ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 94.8MB in the beginning and 155.4MB in the end (delta: -60.6MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.11ms. Allocated memory is still 188.7MB. Free memory was 155.4MB in the beginning and 149.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.39ms. Allocated memory is still 188.7MB. Free memory was 149.2MB in the beginning and 145.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1549.69ms. Allocated memory is still 188.7MB. Free memory was 145.0MB in the beginning and 136.5MB in the end (delta: 8.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * CodeCheck took 281413.71ms. Allocated memory was 188.7MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 136.5MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 701.5MB. Max. memory is 16.1GB. * Witness Printer took 226.47ms. Allocated memory is still 4.6GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 22:39:52,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a21cdac5-91f1-4120-96a1-0a1741743f1f/bin/ukojak-verify-ImItNfHLgk/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