./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:00:19,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:00:19,377 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 01:00:19,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:00:19,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 01:00:19,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:00:19,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:00:19,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 01:00:19,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:00:19,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:00:19,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:00:19,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:00:19,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:00:19,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:00:19,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:00:19,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:00:19,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:00:19,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:00:19,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:00:19,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:00:19,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:00:19,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:00:19,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:00:19,431 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 01:00:19,431 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 01:00:19,432 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 01:00:19,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:00:19,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 01:00:19,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:00:19,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:00:19,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:00:19,434 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 01:00:19,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:00:19,434 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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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 -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2024-11-09 01:00:19,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:00:19,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:00:19,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:00:19,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:00:19,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:00:19,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c Unable to find full path for "g++" [2024-11-09 01:00:21,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:00:21,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:00:21,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-11-09 01:00:21,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/data/b30f5fed7/280f921d7290402e8dadcfb0f2e7b4b5/FLAG8687adf0f [2024-11-09 01:00:22,002 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/data/b30f5fed7/280f921d7290402e8dadcfb0f2e7b4b5 [2024-11-09 01:00:22,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:00:22,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:00:22,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:00:22,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:00:22,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:00:22,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfcecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22, skipping insertion in model container [2024-11-09 01:00:22,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:00:22,467 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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-09 01:00:22,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:00:22,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:00:22,655 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_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-09 01:00:22,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:00:22,710 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:00:22,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22 WrapperNode [2024-11-09 01:00:22,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:00:22,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:00:22,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:00:22,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:00:22,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,820 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 01:00:22,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:00:22,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:00:22,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:00:22,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:00:22,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:00:22,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:00:22,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:00:22,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:00:22,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:00:22" (1/1) ... [2024-11-09 01:00:22,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 01:00:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 01:00:22,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 01:00:22,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 01:00:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:00:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:00:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:00:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:00:23,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:00:23,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:00:24,340 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 01:00:24,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:00:24,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:00:24,668 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:00:24,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:00:24 BoogieIcfgContainer [2024-11-09 01:00:24,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:00:24,670 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 01:00:24,670 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 01:00:24,681 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 01:00:24,682 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:00:24" (1/1) ... [2024-11-09 01:00:24,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:00:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 01:00:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 01:00:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 01:00:24,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:25,670 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-09 01:00:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-09 01:00:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-09 01:00:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 01:00:26,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:26,676 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-09 01:00:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-09 01:00:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-09 01:00:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 01:00:27,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:28,144 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-09 01:00:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-09 01:00:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-09 01:00:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 01:00:29,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:29,391 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-09 01:00:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-09 01:00:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-09 01:00:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 01:00:30,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:30,201 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-09 01:00:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-09 01:00:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-09 01:00:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 01:00:30,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:30,683 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-09 01:00:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-09 01:00:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-09 01:00:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:00:30,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:31,050 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-09 01:00:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-09 01:00:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-09 01:00:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:00:32,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:32,359 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-09 01:00:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-09 01:00:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-09 01:00:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:00:33,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:33,386 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-09 01:00:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-09 01:00:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-09 01:00:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:00:34,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:34,450 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-09 01:00:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-09 01:00:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-09 01:00:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:00:35,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:35,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:36,243 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-09 01:00:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-09 01:00:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-09 01:00:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:00:36,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:36,867 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-09 01:00:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-09 01:00:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-09 01:00:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:00:38,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:39,147 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-09 01:00:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-09 01:00:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-09 01:00:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 01:00:39,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:39,500 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-09 01:00:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-09 01:00:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-09 01:00:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 01:00:40,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:40,420 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-09 01:00:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-09 01:00:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-09 01:00:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:00:40,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:41,043 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-09 01:00:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-09 01:00:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-09 01:00:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:00:42,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:43,152 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-09 01:00:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-09 01:00:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-09 01:00:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:00:44,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:44,620 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-09 01:00:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-09 01:00:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-09 01:00:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:00:44,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:45,179 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-09 01:00:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-09 01:00:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-09 01:00:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:00:45,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:45,679 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-09 01:00:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-09 01:00:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-09 01:00:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:00:46,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:47,038 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-09 01:00:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-09 01:00:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-09 01:00:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 01:00:47,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:00:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 688 states and 834 transitions. [2024-11-09 01:00:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 834 transitions. [2024-11-09 01:00:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 01:00:50,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:50,240 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-09 01:00:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 735 states and 895 transitions. [2024-11-09 01:00:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 895 transitions. [2024-11-09 01:00:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 01:00:51,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:51,797 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-09 01:00:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 750 states and 915 transitions. [2024-11-09 01:00:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 915 transitions. [2024-11-09 01:00:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 01:00:52,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:53,107 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-09 01:00:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 834 states and 1009 transitions. [2024-11-09 01:00:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1009 transitions. [2024-11-09 01:00:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 01:00:56,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:57,001 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-09 01:00:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 884 states and 1072 transitions. [2024-11-09 01:00:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1072 transitions. [2024-11-09 01:00:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 01:00:58,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:00:59,289 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-09 01:00:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:00:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 886 states and 1075 transitions. [2024-11-09 01:00:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1075 transitions. [2024-11-09 01:00:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 01:00:59,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:00:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:00:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:00,138 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-09 01:01:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 948 states and 1148 transitions. [2024-11-09 01:01:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1148 transitions. [2024-11-09 01:01:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 01:01:01,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:02,345 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-09 01:01:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 950 states and 1149 transitions. [2024-11-09 01:01:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1149 transitions. [2024-11-09 01:01:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 01:01:02,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:03,428 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-09 01:01:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1043 states and 1262 transitions. [2024-11-09 01:01:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1262 transitions. [2024-11-09 01:01:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 01:01:06,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:06,635 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-09 01:01:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1047 states and 1267 transitions. [2024-11-09 01:01:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1267 transitions. [2024-11-09 01:01:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 01:01:07,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:07,706 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-09 01:01:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1082 states and 1309 transitions. [2024-11-09 01:01:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1309 transitions. [2024-11-09 01:01:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 01:01:09,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:09,975 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-09 01:01:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1097 states and 1328 transitions. [2024-11-09 01:01:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1328 transitions. [2024-11-09 01:01:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 01:01:10,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 01:01:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1167 states and 1400 transitions. [2024-11-09 01:01:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1400 transitions. [2024-11-09 01:01:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 01:01:13,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:13,707 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-09 01:01:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1233 states and 1475 transitions. [2024-11-09 01:01:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1475 transitions. [2024-11-09 01:01:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 01:01:15,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:16,371 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-09 01:01:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1264 states and 1511 transitions. [2024-11-09 01:01:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1511 transitions. [2024-11-09 01:01:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 01:01:17,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:17,670 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-09 01:01:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1265 states and 1512 transitions. [2024-11-09 01:01:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1512 transitions. [2024-11-09 01:01:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 01:01:18,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:18,558 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-09 01:01:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1325 states and 1585 transitions. [2024-11-09 01:01:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1585 transitions. [2024-11-09 01:01:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 01:01:19,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:20,243 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-09 01:01:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1346 states and 1608 transitions. [2024-11-09 01:01:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1608 transitions. [2024-11-09 01:01:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 01:01:21,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:22,251 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-09 01:01:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1370 states and 1634 transitions. [2024-11-09 01:01:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1634 transitions. [2024-11-09 01:01:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 01:01:23,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:23,402 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-09 01:01:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1383 states and 1648 transitions. [2024-11-09 01:01:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1648 transitions. [2024-11-09 01:01:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 01:01:24,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:24,536 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-09 01:01:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1435 states and 1709 transitions. [2024-11-09 01:01:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1709 transitions. [2024-11-09 01:01:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 01:01:27,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:27,942 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-09 01:01:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1438 states and 1712 transitions. [2024-11-09 01:01:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1712 transitions. [2024-11-09 01:01:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 01:01:28,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:29,112 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-09 01:01:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1463 states and 1741 transitions. [2024-11-09 01:01:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1741 transitions. [2024-11-09 01:01:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 01:01:31,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:32,064 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-09 01:01:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1479 states and 1757 transitions. [2024-11-09 01:01:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1757 transitions. [2024-11-09 01:01:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 01:01:33,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:34,047 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-09 01:01:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1541 states and 1834 transitions. [2024-11-09 01:01:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1834 transitions. [2024-11-09 01:01:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 01:01:37,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:37,764 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-09 01:01:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1550 states and 1842 transitions. [2024-11-09 01:01:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1842 transitions. [2024-11-09 01:01:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 01:01:38,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:38,894 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-09 01:01:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1552 states and 1846 transitions. [2024-11-09 01:01:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1846 transitions. [2024-11-09 01:01:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 01:01:39,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:39,809 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-09 01:01:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1555 states and 1849 transitions. [2024-11-09 01:01:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1849 transitions. [2024-11-09 01:01:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 01:01:39,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:40,816 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-09 01:01:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1689 states and 2002 transitions. [2024-11-09 01:01:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2002 transitions. [2024-11-09 01:01:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 01:01:44,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:45,167 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-09 01:01:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1714 states and 2028 transitions. [2024-11-09 01:01:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2028 transitions. [2024-11-09 01:01:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 01:01:46,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:46,531 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-09 01:01:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1727 states and 2042 transitions. [2024-11-09 01:01:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2042 transitions. [2024-11-09 01:01:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 01:01:47,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:47,749 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-09 01:01:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1730 states and 2046 transitions. [2024-11-09 01:01:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2046 transitions. [2024-11-09 01:01:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 01:01:48,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:48,795 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-09 01:01:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1818 states and 2150 transitions. [2024-11-09 01:01:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2150 transitions. [2024-11-09 01:01:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 01:01:51,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:52,542 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-09 01:01:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 1892 states and 2226 transitions. [2024-11-09 01:01:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2226 transitions. [2024-11-09 01:01:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 01:01:54,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:54,843 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-09 01:01:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1913 states and 2248 transitions. [2024-11-09 01:01:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2248 transitions. [2024-11-09 01:01:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 01:01:56,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:57,088 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-09 01:01:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1915 states and 2250 transitions. [2024-11-09 01:01:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2250 transitions. [2024-11-09 01:01:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 01:01:57,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:57,754 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-09 01:01:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1930 states and 2267 transitions. [2024-11-09 01:01:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2267 transitions. [2024-11-09 01:01:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 01:01:58,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:58,807 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-09 01:02:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1967 states and 2312 transitions. [2024-11-09 01:02:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2312 transitions. [2024-11-09 01:02:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 01:02:00,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 01:02:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1978 states and 2324 transitions. [2024-11-09 01:02:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2324 transitions. [2024-11-09 01:02:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 01:02:01,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:02,089 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-09 01:02:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1981 states and 2330 transitions. [2024-11-09 01:02:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2330 transitions. [2024-11-09 01:02:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 01:02:02,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 01:02:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 1986 states and 2335 transitions. [2024-11-09 01:02:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2335 transitions. [2024-11-09 01:02:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 01:02:04,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:04,617 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-09 01:02:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2000 states and 2351 transitions. [2024-11-09 01:02:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2351 transitions. [2024-11-09 01:02:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 01:02:05,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:05,819 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-09 01:02:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2041 states and 2399 transitions. [2024-11-09 01:02:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2399 transitions. [2024-11-09 01:02:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 01:02:07,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:08,052 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-09 01:02:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2080 states and 2451 transitions. [2024-11-09 01:02:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2451 transitions. [2024-11-09 01:02:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 01:02:11,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:11,762 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-09 01:02:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2094 states and 2466 transitions. [2024-11-09 01:02:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2466 transitions. [2024-11-09 01:02:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 01:02:12,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:13,163 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-09 01:02:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2097 states and 2469 transitions. [2024-11-09 01:02:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2469 transitions. [2024-11-09 01:02:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 01:02:13,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:14,114 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-09 01:02:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2109 states and 2482 transitions. [2024-11-09 01:02:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2482 transitions. [2024-11-09 01:02:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 01:02:15,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:15,952 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-09 01:02:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2111 states and 2485 transitions. [2024-11-09 01:02:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2485 transitions. [2024-11-09 01:02:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 01:02:16,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:17,170 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-09 01:02:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2123 states and 2498 transitions. [2024-11-09 01:02:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2498 transitions. [2024-11-09 01:02:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 01:02:17,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:18,341 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-09 01:02:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2154 states and 2536 transitions. [2024-11-09 01:02:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2536 transitions. [2024-11-09 01:02:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 01:02:21,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:22,467 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-09 01:02:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2223 states and 2622 transitions. [2024-11-09 01:02:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2622 transitions. [2024-11-09 01:02:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 01:02:28,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:28,382 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-09 01:02:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2225 states and 2623 transitions. [2024-11-09 01:02:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2623 transitions. [2024-11-09 01:02:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 01:02:29,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 01:02:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2228 states and 2627 transitions. [2024-11-09 01:02:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2627 transitions. [2024-11-09 01:02:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 01:02:30,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:30,805 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-09 01:02:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2237 states and 2636 transitions. [2024-11-09 01:02:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2636 transitions. [2024-11-09 01:02:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 01:02:31,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:31,457 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-09 01:02:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2261 states and 2662 transitions. [2024-11-09 01:02:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2662 transitions. [2024-11-09 01:02:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 01:02:32,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:32,804 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-09 01:02:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2338 states and 2757 transitions. [2024-11-09 01:02:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2757 transitions. [2024-11-09 01:02:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 01:02:37,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:38,131 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-09 01:02:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2342 states and 2761 transitions. [2024-11-09 01:02:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 2761 transitions. [2024-11-09 01:02:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 01:02:38,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:39,233 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-09 01:02:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2357 states and 2786 transitions. [2024-11-09 01:02:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 2786 transitions. [2024-11-09 01:02:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 01:02:42,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:43,079 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-09 01:02:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2362 states and 2794 transitions. [2024-11-09 01:02:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2794 transitions. [2024-11-09 01:02:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 01:02:44,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:44,762 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-09 01:02:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2364 states and 2797 transitions. [2024-11-09 01:02:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2797 transitions. [2024-11-09 01:02:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 01:02:45,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:46,064 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-09 01:02:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2367 states and 2803 transitions. [2024-11-09 01:02:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2803 transitions. [2024-11-09 01:02:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:02:46,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:47,382 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-09 01:02:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2378 states and 2816 transitions. [2024-11-09 01:02:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2816 transitions. [2024-11-09 01:02:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:02:49,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:50,121 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-09 01:02:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2441 states and 2889 transitions. [2024-11-09 01:02:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 2889 transitions. [2024-11-09 01:02:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:02:58,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:58,919 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-09 01:03:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2457 states and 2904 transitions. [2024-11-09 01:03:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 2904 transitions. [2024-11-09 01:03:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:03:00,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:00,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:01,450 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-09 01:03:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2502 states and 2949 transitions. [2024-11-09 01:03:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2949 transitions. [2024-11-09 01:03:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:03:06,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:06,892 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-09 01:03:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2505 states and 2958 transitions. [2024-11-09 01:03:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2958 transitions. [2024-11-09 01:03:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:03:08,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:08,582 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-09 01:03:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2506 states and 2958 transitions. [2024-11-09 01:03:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2958 transitions. [2024-11-09 01:03:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 01:03:09,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:09,490 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-09 01:03:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2507 states and 2963 transitions. [2024-11-09 01:03:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 2963 transitions. [2024-11-09 01:03:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 01:03:10,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:10,539 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-09 01:03:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2514 states and 2970 transitions. [2024-11-09 01:03:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2970 transitions. [2024-11-09 01:03:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-09 01:03:10,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:11,386 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-09 01:03:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2537 states and 2999 transitions. [2024-11-09 01:03:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2999 transitions. [2024-11-09 01:03:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 01:03:14,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:14,877 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-09 01:03:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 2568 states and 3032 transitions. [2024-11-09 01:03:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3032 transitions. [2024-11-09 01:03:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 01:03:18,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:18,972 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-09 01:03:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2571 states and 3036 transitions. [2024-11-09 01:03:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3036 transitions. [2024-11-09 01:03:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 01:03:19,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:19,616 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-09 01:03:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2584 states and 3058 transitions. [2024-11-09 01:03:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3058 transitions. [2024-11-09 01:03:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 01:03:22,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:22,495 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-09 01:03:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2595 states and 3073 transitions. [2024-11-09 01:03:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3073 transitions. [2024-11-09 01:03:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 01:03:24,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:25,614 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-09 01:03:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 2722 states and 3220 transitions. [2024-11-09 01:03:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3220 transitions. [2024-11-09 01:03:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 01:03:34,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:35,050 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-09 01:03:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 2783 states and 3289 transitions. [2024-11-09 01:03:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3289 transitions. [2024-11-09 01:03:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 01:03:38,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 01:03:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 2788 states and 3295 transitions. [2024-11-09 01:03:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3295 transitions. [2024-11-09 01:03:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 01:03:39,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-09 01:03:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 2789 states and 3295 transitions. [2024-11-09 01:03:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3295 transitions. [2024-11-09 01:03:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-09 01:03:39,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:40,519 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-09 01:03:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 2841 states and 3344 transitions. [2024-11-09 01:03:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3344 transitions. [2024-11-09 01:03:44,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 01:03:44,751 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-11-09 01:03:44,760 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-09 01:04:31,012 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,012 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,013 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,013 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,013 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,014 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,014 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-09 01:04:31,015 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,015 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-09 01:04:31,015 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,016 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,016 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,016 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,017 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,017 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-09 01:04:31,017 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,018 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,018 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,018 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,019 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,019 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,019 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,020 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,020 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,020 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,021 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-09 01:04:31,021 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,021 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-09 01:04:31,022 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,022 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,022 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,022 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-09 01:04:31,023 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,023 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,023 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,024 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,024 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,024 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,025 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-09 01:04:31,025 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-09 01:04:31,025 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,025 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,025 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,026 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,026 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-09 01:04:31,026 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,026 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,026 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 01:04:31,027 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,027 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-09 01:04:31,027 INFO L77 FloydHoareUtils]: At program point L488-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-09 01:04:31,027 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,027 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,028 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,028 INFO L75 FloydHoareUtils]: For program point L489(line 489) no Hoare annotation was computed. [2024-11-09 01:04:31,028 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,029 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,029 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,029 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,029 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 01:04:31,030 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,030 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,030 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,031 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,031 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,031 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-09 01:04:31,032 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,032 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,032 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-09 01:04:31,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 489) no Hoare annotation was computed. [2024-11-09 01:04:31,033 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,033 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-09 01:04:31,033 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,033 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,034 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-09 01:04:31,034 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a7~0 1)) (.cse11 (= ~a17~0 1)) (.cse1 (= ~a20~0 1))) (let ((.cse2 (= ~a17~0 ~a7~0)) (.cse14 (= 14 ~a8~0)) (.cse13 (= ~a7~0 0)) (.cse12 (= ~a20~0 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse3 (not .cse1)) (.cse10 (= 5 ~a16~0)) (.cse6 (= ~a21~0 1)) (.cse5 (not .cse11)) (.cse4 (= ~a12~0 8)) (.cse0 (not .cse7)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a8~0 13) (and .cse4 .cse10 .cse6 .cse11 .cse1 .cse8) (and .cse5 .cse0 (not .cse2)) (and .cse0 (not .cse12) (< ~a16~0 5)) (and .cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse9) (and (not .cse6) .cse0) (and .cse3 .cse4 .cse14 .cse5 .cse6 .cse9) (and .cse4 .cse14 .cse10 .cse5 .cse6) (and .cse0 (not .cse13) .cse12) (and .cse0 .cse12 (not .cse9)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse8) (and (not (and (= ~a16~0 6) .cse1)) .cse0 .cse11) (and .cse5 .cse0 (< 5 ~a16~0)) (and .cse0 (not .cse4)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse0 (not .cse8))))) [2024-11-09 01:04:31,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 01:04:31 ImpRootNode [2024-11-09 01:04:31,055 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 01:04:31,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:04:31,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:04:31,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:04:31,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:00:24" (3/4) ... [2024-11-09 01:04:31,059 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 01:04:31,074 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-09 01:04:31,075 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 01:04:31,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 01:04:31,077 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 01:04:31,224 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 01:04:31,224 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 01:04:31,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:04:31,225 INFO L158 Benchmark]: Toolchain (without parser) took 249220.15ms. Allocated memory was 144.7MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 101.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 871.7MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,226 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 144.7MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:04:31,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.70ms. Allocated memory is still 144.7MB. Free memory was 101.2MB in the beginning and 71.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.69ms. Allocated memory is still 144.7MB. Free memory was 71.3MB in the beginning and 65.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,227 INFO L158 Benchmark]: Boogie Preprocessor took 118.71ms. Allocated memory is still 144.7MB. Free memory was 65.5MB in the beginning and 60.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,227 INFO L158 Benchmark]: RCFGBuilder took 1728.07ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 60.8MB in the beginning and 123.4MB in the end (delta: -62.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,227 INFO L158 Benchmark]: CodeCheck took 246385.23ms. Allocated memory was 207.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 123.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 816.8MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,228 INFO L158 Benchmark]: Witness Printer took 169.18ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:04:31,229 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: 200.0s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318654 SdHoareTripleChecker+Valid, 911.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317761 mSDsluCounter, 42590 SdHoareTripleChecker+Invalid, 790.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36184 mSDsCounter, 66853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 688728 IncrementalHoareTripleChecker+Invalid, 755581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66853 mSolverCounterUnsat, 6406 mSDtfsCounter, 688728 mSolverCounterSat, 6.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137499 GetRequests, 128961 SyntacticMatches, 7506 SemanticMatches, 1032 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767228 ImplicationChecksByTransitivity, 135.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 20421 NumberOfCodeBlocks, 20421 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20321 ConstructedInterpolants, 0 QuantifiedInterpolants, 159361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 24 PerfectInterpolantSequences, 18939/24020 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: 489]: 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)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 144.7MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.70ms. Allocated memory is still 144.7MB. Free memory was 101.2MB in the beginning and 71.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.69ms. Allocated memory is still 144.7MB. Free memory was 71.3MB in the beginning and 65.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.71ms. Allocated memory is still 144.7MB. Free memory was 65.5MB in the beginning and 60.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1728.07ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 60.8MB in the beginning and 123.4MB in the end (delta: -62.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * CodeCheck took 246385.23ms. Allocated memory was 207.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 123.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 816.8MB. Max. memory is 16.1GB. * Witness Printer took 169.18ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 01:04:31,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e811c5d-f8ef-4162-b131-3b5bbbd7300f/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