./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:15:50,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:15:50,739 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:15:50,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:15:50,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:15:50,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:15:50,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:15:50,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:15:50,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:15:50,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:15:50,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:15:50,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:15:50,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:15:50,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:15:50,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:15:50,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:15:50,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:15:50,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:15:50,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:15:50,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:15:50,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:15:50,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:15:50,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:15:50,797 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:15:50,797 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:15:50,797 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:15:50,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:15:50,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:15:50,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:15:50,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:15:50,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:15:50,799 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:15:50,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:15:50,799 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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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 -> 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 [2024-11-08 23:15:51,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:15:51,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:15:51,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:15:51,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:15:51,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:15:51,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c Unable to find full path for "g++" [2024-11-08 23:15:53,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:15:53,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:15:53,400 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-11-08 23:15:53,422 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/data/73c5a12d2/9c429011e0fb4ce5a8b577bd51019371/FLAG9eb519af0 [2024-11-08 23:15:53,443 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/data/73c5a12d2/9c429011e0fb4ce5a8b577bd51019371 [2024-11-08 23:15:53,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:15:53,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:15:53,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:53,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:15:53,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:15:53,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:53" (1/1) ... [2024-11-08 23:15:53,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272dccda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:53, skipping insertion in model container [2024-11-08 23:15:53,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:53" (1/1) ... [2024-11-08 23:15:53,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:15:53,897 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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-11-08 23:15:53,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:53,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:15:54,031 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_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-11-08 23:15:54,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:54,064 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:15:54,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54 WrapperNode [2024-11-08 23:15:54,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:54,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:54,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:15:54,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:15:54,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,168 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 23:15:54,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:54,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:15:54,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:15:54,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:15:54,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:15:54,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:15:54,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:15:54,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:15:54,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:54" (1/1) ... [2024-11-08 23:15:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:15:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:15:54,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:15:54,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:15:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:15:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:15:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:15:54,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:15:54,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:15:54,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:15:55,515 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 23:15:55,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:15:55,814 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:15:55,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:15:55,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:55 BoogieIcfgContainer [2024-11-08 23:15:55,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:15:55,818 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:15:55,818 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:15:55,829 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:15:55,829 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:55" (1/1) ... [2024-11-08 23:15:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:15:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 23:15:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 23:15:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:15:55,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:15:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:56,798 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 23:15:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:15:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-08 23:15:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-08 23:15:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:15:57,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:15:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:15:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:15:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-08 23:15:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-08 23:15:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:15:58,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:15:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:59,311 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 23:16:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-08 23:16:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-08 23:16:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:16:00,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:00,524 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 23:16:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-08 23:16:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-08 23:16:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 23:16:01,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:16:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-08 23:16:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-08 23:16:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:16:01,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:16:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-08 23:16:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-08 23:16:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 23:16:02,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:02,245 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 23:16:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-08 23:16:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-08 23:16:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 23:16:03,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:03,555 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 23:16:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-08 23:16:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-08 23:16:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:16:04,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:16:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-08 23:16:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-08 23:16:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 23:16:05,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:05,817 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 23:16:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-08 23:16:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-08 23:16:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:16:07,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:07,529 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 23:16:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-08 23:16:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-08 23:16:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:16:07,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:08,170 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 23:16:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-08 23:16:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-08 23:16:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:16:10,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:10,649 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 23:16:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-08 23:16:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-08 23:16:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:16:10,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 23:16:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-08 23:16:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-08 23:16:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:16:11,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:16:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-08 23:16:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-08 23:16:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:16:11,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:12,463 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 23:16:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-08 23:16:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-08 23:16:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 23:16:14,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:14,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:14,645 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 23:16:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-08 23:16:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-08 23:16:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 23:16:15,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:16,019 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 23:16:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-08 23:16:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-08 23:16:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:16:16,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 23:16:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-08 23:16:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-08 23:16:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:16:16,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:16:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-08 23:16:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-08 23:16:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:16:18,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:18,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 23:16:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-08 23:16:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-08 23:16:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 23:16:18,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:19,108 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 23:16:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-08 23:16:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-08 23:16:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:16:19,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:16:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-08 23:16:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-08 23:16:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:16:20,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:16:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-08 23:16:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-08 23:16:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:16:21,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:22,540 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 23:16:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-11-08 23:16:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-11-08 23:16:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:16:25,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 854 states and 1035 transitions. [2024-11-08 23:16:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1035 transitions. [2024-11-08 23:16:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:16:28,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-11-08 23:16:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-11-08 23:16:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:16:28,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:16:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-11-08 23:16:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-11-08 23:16:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:16:31,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:16:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-11-08 23:16:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-11-08 23:16:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:16:32,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:32,897 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 23:16:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-11-08 23:16:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-11-08 23:16:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:16:35,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:36,111 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 23:16:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-11-08 23:16:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-11-08 23:16:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:16:36,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:16:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1052 states and 1271 transitions. [2024-11-08 23:16:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1271 transitions. [2024-11-08 23:16:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 23:16:39,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 23:16:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1067 states and 1290 transitions. [2024-11-08 23:16:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1290 transitions. [2024-11-08 23:16:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 23:16:39,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:16:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1159 states and 1386 transitions. [2024-11-08 23:16:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1386 transitions. [2024-11-08 23:16:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:16:42,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1203 states and 1436 transitions. [2024-11-08 23:16:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1436 transitions. [2024-11-08 23:16:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:16:45,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1234 states and 1472 transitions. [2024-11-08 23:16:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1472 transitions. [2024-11-08 23:16:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:16:46,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1235 states and 1473 transitions. [2024-11-08 23:16:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1473 transitions. [2024-11-08 23:16:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:16:47,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:47,619 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 23:16:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1281 states and 1531 transitions. [2024-11-08 23:16:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1531 transitions. [2024-11-08 23:16:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:16:48,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:49,059 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 23:16:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1295 states and 1546 transitions. [2024-11-08 23:16:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1546 transitions. [2024-11-08 23:16:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 23:16:49,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:49,829 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 23:16:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1316 states and 1569 transitions. [2024-11-08 23:16:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1569 transitions. [2024-11-08 23:16:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 23:16:51,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:51,728 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 23:16:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1351 states and 1606 transitions. [2024-11-08 23:16:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1606 transitions. [2024-11-08 23:16:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 23:16:52,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 23:16:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1404 states and 1667 transitions. [2024-11-08 23:16:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1667 transitions. [2024-11-08 23:16:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 23:16:56,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 23:16:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1406 states and 1670 transitions. [2024-11-08 23:16:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1670 transitions. [2024-11-08 23:16:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 23:16:57,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:16:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:16:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1431 states and 1700 transitions. [2024-11-08 23:16:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1700 transitions. [2024-11-08 23:16:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 23:16:59,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:16:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:17:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1448 states and 1717 transitions. [2024-11-08 23:17:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1717 transitions. [2024-11-08 23:17:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:17:01,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:02,165 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 23:17:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1512 states and 1798 transitions. [2024-11-08 23:17:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1798 transitions. [2024-11-08 23:17:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:17:06,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:06,598 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 23:17:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1522 states and 1807 transitions. [2024-11-08 23:17:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1807 transitions. [2024-11-08 23:17:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 23:17:07,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:07,911 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 23:17:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1525 states and 1810 transitions. [2024-11-08 23:17:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1810 transitions. [2024-11-08 23:17:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:17:08,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:17:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1659 states and 1962 transitions. [2024-11-08 23:17:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1962 transitions. [2024-11-08 23:17:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 23:17:13,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 23:17:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1684 states and 1988 transitions. [2024-11-08 23:17:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 1988 transitions. [2024-11-08 23:17:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 23:17:14,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:14,600 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 23:17:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1697 states and 2003 transitions. [2024-11-08 23:17:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2003 transitions. [2024-11-08 23:17:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 23:17:15,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:15,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:15,643 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 23:17:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 1700 states and 2007 transitions. [2024-11-08 23:17:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2007 transitions. [2024-11-08 23:17:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 23:17:16,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:16,690 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 23:17:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 1788 states and 2109 transitions. [2024-11-08 23:17:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2109 transitions. [2024-11-08 23:17:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 23:17:19,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:17:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 1862 states and 2185 transitions. [2024-11-08 23:17:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2185 transitions. [2024-11-08 23:17:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 23:17:22,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 23:17:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 1883 states and 2207 transitions. [2024-11-08 23:17:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2207 transitions. [2024-11-08 23:17:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 23:17:24,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 23:17:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 1885 states and 2209 transitions. [2024-11-08 23:17:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2209 transitions. [2024-11-08 23:17:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 23:17:25,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:17:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 1900 states and 2226 transitions. [2024-11-08 23:17:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2226 transitions. [2024-11-08 23:17:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 23:17:26,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 23:17:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1937 states and 2271 transitions. [2024-11-08 23:17:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2271 transitions. [2024-11-08 23:17:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 23:17:28,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:28,598 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 23:17:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1966 states and 2305 transitions. [2024-11-08 23:17:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2305 transitions. [2024-11-08 23:17:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 23:17:29,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:17:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1980 states and 2324 transitions. [2024-11-08 23:17:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2324 transitions. [2024-11-08 23:17:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 23:17:31,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:32,382 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 23:17:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 1986 states and 2332 transitions. [2024-11-08 23:17:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2332 transitions. [2024-11-08 23:17:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 23:17:34,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:34,649 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 23:17:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 1989 states and 2335 transitions. [2024-11-08 23:17:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2335 transitions. [2024-11-08 23:17:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 23:17:34,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:35,188 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 23:17:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2030 states and 2383 transitions. [2024-11-08 23:17:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2383 transitions. [2024-11-08 23:17:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 23:17:36,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:17:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2069 states and 2435 transitions. [2024-11-08 23:17:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2435 transitions. [2024-11-08 23:17:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 23:17:40,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:40,961 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 23:17:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2083 states and 2450 transitions. [2024-11-08 23:17:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2450 transitions. [2024-11-08 23:17:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 23:17:41,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 23:17:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2086 states and 2452 transitions. [2024-11-08 23:17:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2452 transitions. [2024-11-08 23:17:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 23:17:43,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 23:17:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2098 states and 2467 transitions. [2024-11-08 23:17:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2467 transitions. [2024-11-08 23:17:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 23:17:44,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 23:17:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2100 states and 2469 transitions. [2024-11-08 23:17:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2469 transitions. [2024-11-08 23:17:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 23:17:45,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 23:17:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2112 states and 2483 transitions. [2024-11-08 23:17:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2483 transitions. [2024-11-08 23:17:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 23:17:46,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 23:17:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2113 states and 2483 transitions. [2024-11-08 23:17:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2483 transitions. [2024-11-08 23:17:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 23:17:47,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:47,712 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 23:17:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2190 states and 2579 transitions. [2024-11-08 23:17:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2579 transitions. [2024-11-08 23:17:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 23:17:54,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:54,783 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 23:17:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2207 states and 2597 transitions. [2024-11-08 23:17:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2597 transitions. [2024-11-08 23:17:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 23:17:56,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:57,195 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 23:17:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2216 states and 2606 transitions. [2024-11-08 23:17:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2606 transitions. [2024-11-08 23:17:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 23:17:57,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-08 23:17:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2240 states and 2632 transitions. [2024-11-08 23:17:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2632 transitions. [2024-11-08 23:17:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:17:58,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:17:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:59,078 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 23:18:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2261 states and 2666 transitions. [2024-11-08 23:18:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2666 transitions. [2024-11-08 23:18:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:18:00,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:00,665 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 23:18:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2282 states and 2688 transitions. [2024-11-08 23:18:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2688 transitions. [2024-11-08 23:18:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:18:02,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:02,953 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 23:18:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2286 states and 2692 transitions. [2024-11-08 23:18:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2692 transitions. [2024-11-08 23:18:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:18:03,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:18:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2301 states and 2716 transitions. [2024-11-08 23:18:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2716 transitions. [2024-11-08 23:18:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:18:07,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:18:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2306 states and 2725 transitions. [2024-11-08 23:18:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2725 transitions. [2024-11-08 23:18:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 23:18:09,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:18:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2308 states and 2729 transitions. [2024-11-08 23:18:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2729 transitions. [2024-11-08 23:18:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 23:18:10,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:10,758 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 23:18:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2311 states and 2735 transitions. [2024-11-08 23:18:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2735 transitions. [2024-11-08 23:18:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:11,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 23:18:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2322 states and 2748 transitions. [2024-11-08 23:18:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2748 transitions. [2024-11-08 23:18:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:13,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:14,502 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 23:18:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2383 states and 2816 transitions. [2024-11-08 23:18:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2816 transitions. [2024-11-08 23:18:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:21,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:22,276 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 23:18:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2386 states and 2821 transitions. [2024-11-08 23:18:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2821 transitions. [2024-11-08 23:18:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:23,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:24,091 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 23:18:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2431 states and 2866 transitions. [2024-11-08 23:18:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2866 transitions. [2024-11-08 23:18:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:29,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:29,628 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 23:18:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2446 states and 2881 transitions. [2024-11-08 23:18:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2881 transitions. [2024-11-08 23:18:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:31,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 23:18:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2449 states and 2893 transitions. [2024-11-08 23:18:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 2893 transitions. [2024-11-08 23:18:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:32,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 23:18:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2450 states and 2893 transitions. [2024-11-08 23:18:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2893 transitions. [2024-11-08 23:18:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 23:18:33,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 23:18:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2451 states and 2895 transitions. [2024-11-08 23:18:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2895 transitions. [2024-11-08 23:18:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 23:18:34,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:35,022 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 23:18:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2458 states and 2902 transitions. [2024-11-08 23:18:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 2902 transitions. [2024-11-08 23:18:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 23:18:35,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 23:18:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2481 states and 2932 transitions. [2024-11-08 23:18:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 2932 transitions. [2024-11-08 23:18:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 23:18:38,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:39,183 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 23:18:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2512 states and 2965 transitions. [2024-11-08 23:18:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 2965 transitions. [2024-11-08 23:18:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 23:18:42,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:43,445 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 23:18:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2515 states and 2969 transitions. [2024-11-08 23:18:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2969 transitions. [2024-11-08 23:18:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 23:18:43,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 23:18:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2526 states and 2984 transitions. [2024-11-08 23:18:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 2984 transitions. [2024-11-08 23:18:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 23:18:46,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 23:18:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 2538 states and 3003 transitions. [2024-11-08 23:18:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3003 transitions. [2024-11-08 23:18:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 23:18:49,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 23:18:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 2539 states and 3007 transitions. [2024-11-08 23:18:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3007 transitions. [2024-11-08 23:18:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 23:18:50,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,033 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 23:18:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 2664 states and 3151 transitions. [2024-11-08 23:18:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3151 transitions. [2024-11-08 23:18:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 23:18:59,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:00,335 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 23:19:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 2725 states and 3220 transitions. [2024-11-08 23:19:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3220 transitions. [2024-11-08 23:19:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 23:19:03,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,364 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 23:19:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 2730 states and 3226 transitions. [2024-11-08 23:19:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3226 transitions. [2024-11-08 23:19:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 23:19:04,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-08 23:19:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 2731 states and 3226 transitions. [2024-11-08 23:19:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3226 transitions. [2024-11-08 23:19:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 23:19:05,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,105 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 23:19:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 2783 states and 3274 transitions. [2024-11-08 23:19:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3274 transitions. [2024-11-08 23:19:09,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:19:09,938 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 102 iterations. [2024-11-08 23:19:09,950 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 23:19:54,126 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,127 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,127 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,127 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,128 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,128 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,128 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-08 23:19:54,128 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,129 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-08 23:19:54,129 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,129 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,130 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,130 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,131 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,131 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-08 23:19:54,131 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,131 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,132 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,132 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,133 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,133 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,133 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,133 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,134 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,134 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,135 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-08 23:19:54,135 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,135 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-08 23:19:54,135 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-08 23:19:54,136 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,136 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,136 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,136 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-08 23:19:54,137 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,137 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,137 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,137 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,138 INFO L77 FloydHoareUtils]: At program point L515-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-08 23:19:54,138 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,138 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,139 INFO L75 FloydHoareUtils]: For program point L516(line 516) no Hoare annotation was computed. [2024-11-08 23:19:54,139 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-08 23:19:54,139 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,140 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,140 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,140 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,140 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-08 23:19:54,141 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,141 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,141 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:19:54,141 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,142 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-08 23:19:54,142 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,142 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,143 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,143 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,143 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,144 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,144 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,144 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:19:54,144 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,145 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,145 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,145 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,146 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,146 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-08 23:19:54,146 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,146 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,147 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-08 23:19:54,147 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 516) no Hoare annotation was computed. [2024-11-08 23:19:54,147 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,148 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-08 23:19:54,148 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,148 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,148 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-08 23:19:54,149 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-08 23:19:54,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:19:54 ImpRootNode [2024-11-08 23:19:54,178 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:19:54,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:19:54,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:19:54,179 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:19:54,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:55" (3/4) ... [2024-11-08 23:19:54,182 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:19:54,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-08 23:19:54,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 23:19:54,214 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:19:54,214 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:19:54,372 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:19:54,372 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:19:54,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:19:54,373 INFO L158 Benchmark]: Toolchain (without parser) took 240925.71ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 116.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 752.9MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,374 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 79.3MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:19:54,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.58ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 86.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.96ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 81.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,375 INFO L158 Benchmark]: Boogie Preprocessor took 111.73ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 76.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,375 INFO L158 Benchmark]: RCFGBuilder took 1535.50ms. Allocated memory is still 155.2MB. Free memory was 76.2MB in the beginning and 80.0MB in the end (delta: -3.8MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,376 INFO L158 Benchmark]: CodeCheck took 238360.29ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 80.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 700.4MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,376 INFO L158 Benchmark]: Witness Printer took 194.41ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:19:54,378 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: 194.1s, OverallIterations: 102, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319657 SdHoareTripleChecker+Valid, 941.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318755 mSDsluCounter, 42452 SdHoareTripleChecker+Invalid, 817.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36041 mSDsCounter, 66924 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690938 IncrementalHoareTripleChecker+Invalid, 757862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66924 mSolverCounterUnsat, 6411 mSDtfsCounter, 690938 mSolverCounterSat, 8.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139310 GetRequests, 130720 SyntacticMatches, 7592 SemanticMatches, 998 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702770 ImplicationChecksByTransitivity, 130.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 20711 NumberOfCodeBlocks, 20711 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 20610 ConstructedInterpolants, 0 QuantifiedInterpolants, 168036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 24 PerfectInterpolantSequences, 18769/24469 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: 516]: 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: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 79.3MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.58ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 86.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.96ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 81.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.73ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 76.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1535.50ms. Allocated memory is still 155.2MB. Free memory was 76.2MB in the beginning and 80.0MB in the end (delta: -3.8MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * CodeCheck took 238360.29ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 80.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 700.4MB. Max. memory is 16.1GB. * Witness Printer took 194.41ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.5GB 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 23:19:54,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9a4990-8a9c-40b3-8997-b45aa3f8acea/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