./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm --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 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:40:12,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:40:12,756 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:40:12,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:40:12,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:40:12,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:40:12,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:40:12,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:40:12,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:40:12,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:40:12,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:40:12,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:40:12,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:40:12,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:40:12,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:40:12,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:40:12,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:40:12,795 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:40:12,796 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:40:12,796 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:40:12,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:40:12,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:40:12,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:40:12,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:40:12,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:40:12,797 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:40:12,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:40:12,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm 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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2024-11-13 21:40:13,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:40:13,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:40:13,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:40:13,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:40:13,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:40:13,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c Unable to find full path for "g++" [2024-11-13 21:40:15,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:40:16,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:40:16,042 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2024-11-13 21:40:16,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/data/04138dc29/3b3d80346cd845618c92a4fc3053af43/FLAGc619d70aa [2024-11-13 21:40:16,099 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/data/04138dc29/3b3d80346cd845618c92a4fc3053af43 [2024-11-13 21:40:16,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:40:16,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:40:16,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:40:16,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:40:16,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:40:16,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1026a4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16, skipping insertion in model container [2024-11-13 21:40:16,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:40:16,630 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_4ed315eb-337a-4e9e-8774-32d555284205/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-11-13 21:40:16,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:40:16,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:40:16,762 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_4ed315eb-337a-4e9e-8774-32d555284205/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-11-13 21:40:16,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:40:16,794 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:40:16,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16 WrapperNode [2024-11-13 21:40:16,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:40:16,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:40:16,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:40:16,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:40:16,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,893 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:40:16,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:40:16,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:40:16,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:40:16,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:40:16,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:16,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:17,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:40:17,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:40:17,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:40:17,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:40:17,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:16" (1/1) ... [2024-11-13 21:40:17,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:40:17,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:40:17,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:40:17,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:40:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:40:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:40:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:40:17,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:40:17,214 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:40:17,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:40:18,886 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:40:18,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:40:19,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:40:19,270 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:40:19,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:40:19 BoogieIcfgContainer [2024-11-13 21:40:19,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:40:19,274 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:40:19,274 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:40:19,285 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:40:19,285 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:40:19" (1/1) ... [2024-11-13 21:40:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:40:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:40:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:40:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:40:19,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:20,672 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-13 21:40:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-13 21:40:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-13 21:40:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:40:21,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:21,900 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-13 21:40:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-13 21:40:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-13 21:40:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:40:23,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:23,804 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-13 21:40:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-13 21:40:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-13 21:40:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 21:40:25,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:25,504 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-13 21:40:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-13 21:40:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-13 21:40:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 21:40:26,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:26,622 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-13 21:40:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-13 21:40:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-13 21:40:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:40:26,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:27,287 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-13 21:40:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-13 21:40:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-13 21:40:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 21:40:27,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:27,705 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-13 21:40:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-13 21:40:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-13 21:40:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:40:29,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:29,392 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-13 21:40:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-13 21:40:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-13 21:40:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:40:30,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:30,646 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-13 21:40:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-13 21:40:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-13 21:40:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:40:31,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:32,041 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-13 21:40:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-13 21:40:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-13 21:40:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 21:40:33,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:34,226 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-13 21:40:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-13 21:40:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-13 21:40:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:40:34,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:35,070 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-13 21:40:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-13 21:40:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-13 21:40:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:40:37,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:37,748 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-13 21:40:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-13 21:40:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-13 21:40:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:40:38,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:40:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-11-13 21:40:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-11-13 21:40:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:40:39,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:39,513 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-13 21:40:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-11-13 21:40:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-13 21:40:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:40:39,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-11-13 21:40:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-11-13 21:40:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:40:42,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:42,876 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-13 21:40:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-11-13 21:40:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-11-13 21:40:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:40:44,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:44,721 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-13 21:40:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-11-13 21:40:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-11-13 21:40:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:40:45,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:45,379 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-13 21:40:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-13 21:40:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-13 21:40:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:40:45,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:45,947 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-13 21:40:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-11-13 21:40:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-11-13 21:40:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 21:40:47,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:47,389 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-13 21:40:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-11-13 21:40:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-11-13 21:40:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 21:40:47,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:40:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-11-13 21:40:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-11-13 21:40:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 21:40:48,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:48,788 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-13 21:40:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-11-13 21:40:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-11-13 21:40:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 21:40:49,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:50,228 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-13 21:40:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-11-13 21:40:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-11-13 21:40:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 21:40:51,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:52,048 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-13 21:40:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-11-13 21:40:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-11-13 21:40:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:40:55,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:56,325 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-13 21:40:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-11-13 21:40:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-11-13 21:40:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 21:40:58,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:59,303 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-13 21:41:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-11-13 21:41:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-11-13 21:41:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 21:41:01,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:01,855 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-13 21:41:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-11-13 21:41:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-11-13 21:41:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:02,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:03,005 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-13 21:41:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-11-13 21:41:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-11-13 21:41:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:05,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:05,891 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-13 21:41:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-11-13 21:41:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-11-13 21:41:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:06,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 21:41:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-11-13 21:41:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-11-13 21:41:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 21:41:08,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:08,802 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-13 21:41:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-11-13 21:41:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-11-13 21:41:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 21:41:09,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:09,684 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-13 21:41:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1136 states and 1356 transitions. [2024-11-13 21:41:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1356 transitions. [2024-11-13 21:41:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:41:12,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:12,755 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-13 21:41:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-11-13 21:41:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-11-13 21:41:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:41:14,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:15,102 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-13 21:41:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1232 states and 1465 transitions. [2024-11-13 21:41:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1465 transitions. [2024-11-13 21:41:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:41:16,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:16,704 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-13 21:41:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-11-13 21:41:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-11-13 21:41:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:41:17,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:17,703 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-13 21:41:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-11-13 21:41:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-11-13 21:41:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:41:19,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:19,414 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-13 21:41:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1331 states and 1582 transitions. [2024-11-13 21:41:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1582 transitions. [2024-11-13 21:41:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:41:21,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:21,725 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-13 21:41:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1353 states and 1611 transitions. [2024-11-13 21:41:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1611 transitions. [2024-11-13 21:41:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:41:23,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:24,385 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-13 21:41:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1386 states and 1646 transitions. [2024-11-13 21:41:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1646 transitions. [2024-11-13 21:41:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:41:26,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:26,954 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-13 21:41:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1388 states and 1650 transitions. [2024-11-13 21:41:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1650 transitions. [2024-11-13 21:41:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:41:27,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:27,808 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-13 21:41:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1411 states and 1676 transitions. [2024-11-13 21:41:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1676 transitions. [2024-11-13 21:41:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 21:41:29,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:29,983 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-13 21:41:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1427 states and 1692 transitions. [2024-11-13 21:41:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1692 transitions. [2024-11-13 21:41:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:41:31,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:31,674 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-13 21:41:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1474 states and 1754 transitions. [2024-11-13 21:41:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1754 transitions. [2024-11-13 21:41:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:41:34,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:35,166 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-13 21:41:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1484 states and 1763 transitions. [2024-11-13 21:41:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1763 transitions. [2024-11-13 21:41:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:41:36,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:36,672 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-13 21:41:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1500 states and 1783 transitions. [2024-11-13 21:41:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1783 transitions. [2024-11-13 21:41:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:41:37,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:38,247 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-13 21:41:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1503 states and 1786 transitions. [2024-11-13 21:41:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1786 transitions. [2024-11-13 21:41:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:41:38,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:39,626 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-13 21:41:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1637 states and 1938 transitions. [2024-11-13 21:41:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1938 transitions. [2024-11-13 21:41:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:41:44,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:45,081 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-13 21:41:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1675 states and 1978 transitions. [2024-11-13 21:41:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1978 transitions. [2024-11-13 21:41:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:41:46,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:47,322 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-13 21:41:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1688 states and 1993 transitions. [2024-11-13 21:41:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1993 transitions. [2024-11-13 21:41:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:41:47,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:48,336 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-13 21:41:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1691 states and 1997 transitions. [2024-11-13 21:41:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1997 transitions. [2024-11-13 21:41:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 21:41:48,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:49,574 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-13 21:41:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1779 states and 2097 transitions. [2024-11-13 21:41:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2097 transitions. [2024-11-13 21:41:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 21:41:52,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:52,974 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-13 21:41:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1853 states and 2173 transitions. [2024-11-13 21:41:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2173 transitions. [2024-11-13 21:41:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:41:54,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:55,203 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-13 21:41:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1874 states and 2195 transitions. [2024-11-13 21:41:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2195 transitions. [2024-11-13 21:41:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 21:41:56,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:57,330 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-13 21:41:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 1876 states and 2197 transitions. [2024-11-13 21:41:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2197 transitions. [2024-11-13 21:41:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:41:57,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:57,928 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-13 21:41:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1891 states and 2214 transitions. [2024-11-13 21:41:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2214 transitions. [2024-11-13 21:41:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:41:58,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:58,909 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-13 21:42:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1928 states and 2259 transitions. [2024-11-13 21:42:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2259 transitions. [2024-11-13 21:42:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:42:00,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:00,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:01,185 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-13 21:42:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1939 states and 2271 transitions. [2024-11-13 21:42:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2271 transitions. [2024-11-13 21:42:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:42:01,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:02,440 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-13 21:42:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1942 states and 2275 transitions. [2024-11-13 21:42:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2275 transitions. [2024-11-13 21:42:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:42:03,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:42:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1945 states and 2278 transitions. [2024-11-13 21:42:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2278 transitions. [2024-11-13 21:42:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 21:42:03,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:42:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 1958 states and 2293 transitions. [2024-11-13 21:42:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2293 transitions. [2024-11-13 21:42:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:42:06,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:06,387 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-13 21:42:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1972 states and 2309 transitions. [2024-11-13 21:42:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2309 transitions. [2024-11-13 21:42:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:42:07,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:07,441 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-13 21:42:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2013 states and 2357 transitions. [2024-11-13 21:42:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2357 transitions. [2024-11-13 21:42:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:42:08,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:09,572 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-13 21:42:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2052 states and 2409 transitions. [2024-11-13 21:42:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2409 transitions. [2024-11-13 21:42:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:42:12,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:13,310 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-13 21:42:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2066 states and 2424 transitions. [2024-11-13 21:42:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2424 transitions. [2024-11-13 21:42:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:42:14,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:14,905 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-13 21:42:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2069 states and 2427 transitions. [2024-11-13 21:42:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2427 transitions. [2024-11-13 21:42:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 21:42:15,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:15,839 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-13 21:42:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2081 states and 2443 transitions. [2024-11-13 21:42:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2443 transitions. [2024-11-13 21:42:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 21:42:17,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:17,938 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-13 21:42:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2083 states and 2445 transitions. [2024-11-13 21:42:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2445 transitions. [2024-11-13 21:42:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:42:18,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,982 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-13 21:42:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2095 states and 2457 transitions. [2024-11-13 21:42:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2457 transitions. [2024-11-13 21:42:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:42:19,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:20,499 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-13 21:42:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2172 states and 2550 transitions. [2024-11-13 21:42:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2550 transitions. [2024-11-13 21:42:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:42:28,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:28,552 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-13 21:42:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2174 states and 2551 transitions. [2024-11-13 21:42:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2551 transitions. [2024-11-13 21:42:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:42:29,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:29,632 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-13 21:42:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2177 states and 2554 transitions. [2024-11-13 21:42:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2554 transitions. [2024-11-13 21:42:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:42:30,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:30,370 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-13 21:42:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2186 states and 2563 transitions. [2024-11-13 21:42:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2563 transitions. [2024-11-13 21:42:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:42:30,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:30,862 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-13 21:42:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2210 states and 2589 transitions. [2024-11-13 21:42:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2589 transitions. [2024-11-13 21:42:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:42:31,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:32,277 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-13 21:42:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2287 states and 2685 transitions. [2024-11-13 21:42:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2685 transitions. [2024-11-13 21:42:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:42:37,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:37,958 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-13 21:42:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2291 states and 2689 transitions. [2024-11-13 21:42:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2689 transitions. [2024-11-13 21:42:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:42:38,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-13 21:42:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2294 states and 2692 transitions. [2024-11-13 21:42:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2692 transitions. [2024-11-13 21:42:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:42:39,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-13 21:42:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2297 states and 2695 transitions. [2024-11-13 21:42:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2695 transitions. [2024-11-13 21:42:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 21:42:39,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:39,862 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-13 21:42:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2300 states and 2698 transitions. [2024-11-13 21:42:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 2698 transitions. [2024-11-13 21:42:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:42:40,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:40,441 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-13 21:42:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2311 states and 2711 transitions. [2024-11-13 21:42:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2711 transitions. [2024-11-13 21:42:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:42:42,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:43,003 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-13 21:42:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2381 states and 2789 transitions. [2024-11-13 21:42:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2789 transitions. [2024-11-13 21:42:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:42:52,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:53,295 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-13 21:42:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2428 states and 2837 transitions. [2024-11-13 21:42:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2837 transitions. [2024-11-13 21:42:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:42:58,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:58,656 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-13 21:42:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2430 states and 2838 transitions. [2024-11-13 21:42:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2838 transitions. [2024-11-13 21:42:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:42:59,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:59,452 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-13 21:43:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2431 states and 2838 transitions. [2024-11-13 21:43:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2838 transitions. [2024-11-13 21:43:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:43:00,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:00,413 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-13 21:43:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2432 states and 2838 transitions. [2024-11-13 21:43:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2838 transitions. [2024-11-13 21:43:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:43:01,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:01,552 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-13 21:43:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2439 states and 2845 transitions. [2024-11-13 21:43:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2845 transitions. [2024-11-13 21:43:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 21:43:01,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:43:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2440 states and 2845 transitions. [2024-11-13 21:43:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 2845 transitions. [2024-11-13 21:43:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:43:02,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:02,904 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-13 21:43:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2471 states and 2878 transitions. [2024-11-13 21:43:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2878 transitions. [2024-11-13 21:43:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:06,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:06,999 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-13 21:43:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2474 states and 2882 transitions. [2024-11-13 21:43:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 2882 transitions. [2024-11-13 21:43:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:07,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:07,541 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-13 21:43:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2485 states and 2900 transitions. [2024-11-13 21:43:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 2900 transitions. [2024-11-13 21:43:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:09,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:09,991 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-13 21:43:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2486 states and 2901 transitions. [2024-11-13 21:43:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2901 transitions. [2024-11-13 21:43:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:10,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:11,108 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-13 21:43:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2487 states and 2902 transitions. [2024-11-13 21:43:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2902 transitions. [2024-11-13 21:43:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:11,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:12,174 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-13 21:43:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2488 states and 2905 transitions. [2024-11-13 21:43:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2905 transitions. [2024-11-13 21:43:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:43:12,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:13,520 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-13 21:43:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 2598 states and 3027 transitions. [2024-11-13 21:43:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3027 transitions. [2024-11-13 21:43:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:43:20,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:21,234 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-13 21:43:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2659 states and 3096 transitions. [2024-11-13 21:43:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3096 transitions. [2024-11-13 21:43:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 21:43:24,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:24,694 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-13 21:43:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 2664 states and 3102 transitions. [2024-11-13 21:43:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3102 transitions. [2024-11-13 21:43:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:43:25,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:25,331 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-13 21:43:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 2665 states and 3102 transitions. [2024-11-13 21:43:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3102 transitions. [2024-11-13 21:43:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 21:43:25,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:26,235 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-13 21:43:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 2717 states and 3151 transitions. [2024-11-13 21:43:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3151 transitions. [2024-11-13 21:43:30,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:43:30,415 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 99 iterations. [2024-11-13 21:43:30,425 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:44:09,168 INFO L77 FloydHoareUtils]: At program point L102(lines 102 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-13 21:44:09,169 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-13 21:44:09,169 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-13 21:44:09,169 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-13 21:44:09,169 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-13 21:44:09,170 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-13 21:44:09,170 INFO L77 FloydHoareUtils]: At program point L72(lines 72 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-13 21:44:09,170 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-13 21:44:09,171 INFO L77 FloydHoareUtils]: At program point L139(lines 139 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-13 21:44:09,171 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-13 21:44:09,171 INFO L77 FloydHoareUtils]: At program point L107(lines 107 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-13 21:44:09,171 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-13 21:44:09,172 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-13 21:44:09,172 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-13 21:44:09,172 INFO L77 FloydHoareUtils]: At program point L75(lines 75 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-13 21:44:09,172 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-13 21:44:09,173 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-13 21:44:09,173 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-13 21:44:09,173 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-13 21:44:09,174 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-13 21:44:09,174 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-13 21:44:09,174 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-13 21:44:09,174 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-13 21:44:09,175 INFO L77 FloydHoareUtils]: At program point L112(lines 112 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-13 21:44:09,175 INFO L77 FloydHoareUtils]: At program point L575-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 21:44:09,175 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-13 21:44:09,176 INFO L77 FloydHoareUtils]: At program point L146(lines 146 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-13 21:44:09,176 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-13 21:44:09,176 INFO L77 FloydHoareUtils]: At program point L82(lines 82 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-13 21:44:09,176 INFO L77 FloydHoareUtils]: At program point L578-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 21:44:09,177 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-13 21:44:09,177 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-13 21:44:09,177 INFO L75 FloydHoareUtils]: For program point L579(line 579) no Hoare annotation was computed. [2024-11-13 21:44:09,177 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-13 21:44:09,177 INFO L77 FloydHoareUtils]: At program point L150(lines 150 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-13 21:44:09,178 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-13 21:44:09,178 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-13 21:44:09,178 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-13 21:44:09,178 INFO L77 FloydHoareUtils]: At program point L118(lines 118 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-13 21:44:09,178 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-13 21:44:09,179 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-13 21:44:09,179 INFO L77 FloydHoareUtils]: At program point L154(lines 154 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-13 21:44:09,179 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-13 21:44:09,181 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-13 21:44:09,182 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-13 21:44:09,182 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-13 21:44:09,182 INFO L77 FloydHoareUtils]: At program point L90(lines 90 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-13 21:44:09,182 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-13 21:44:09,183 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-13 21:44:09,183 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:44:09,183 INFO L77 FloydHoareUtils]: At program point L124(lines 124 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-13 21:44:09,183 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 21:44:09,183 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-13 21:44:09,184 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-13 21:44:09,184 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-13 21:44:09,184 INFO L77 FloydHoareUtils]: At program point L94(lines 94 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-13 21:44:09,184 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-13 21:44:09,185 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-13 21:44:09,185 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-13 21:44:09,185 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:44:09,185 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-13 21:44:09,186 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-13 21:44:09,186 INFO L77 FloydHoareUtils]: At program point L129(lines 129 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-13 21:44:09,186 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-13 21:44:09,186 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-13 21:44:09,187 INFO L77 FloydHoareUtils]: At program point L64(lines 64 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-13 21:44:09,187 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-13 21:44:09,187 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-13 21:44:09,187 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-13 21:44:09,188 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2024-11-13 21:44:09,188 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-13 21:44:09,188 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-13 21:44:09,188 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-13 21:44:09,188 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-13 21:44:09,189 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-13 21:44:09,189 INFO L77 FloydHoareUtils]: At program point L134(lines 134 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-13 21:44:09,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:44:09 ImpRootNode [2024-11-13 21:44:09,215 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:44:09,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:44:09,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:44:09,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:44:09,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:40:19" (3/4) ... [2024-11-13 21:44:09,219 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:44:09,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-11-13 21:44:09,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-13 21:44:09,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 21:44:09,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:44:09,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:44:09,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:44:09,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:44:09,415 INFO L158 Benchmark]: Toolchain (without parser) took 233312.06ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 90.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 605.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,416 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:44:09,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.33ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.94ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,417 INFO L158 Benchmark]: Boogie Preprocessor took 113.85ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,417 INFO L158 Benchmark]: RCFGBuilder took 2261.81ms. Allocated memory is still 117.4MB. Free memory was 54.3MB in the beginning and 69.7MB in the end (delta: -15.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,417 INFO L158 Benchmark]: CodeCheck took 229941.80ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 68.9MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,418 INFO L158 Benchmark]: Witness Printer took 198.41ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:44:09,420 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: 191.1s, OverallIterations: 99, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303165 SdHoareTripleChecker+Valid, 1060.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 302290 mSDsluCounter, 39869 SdHoareTripleChecker+Invalid, 911.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33837 mSDsCounter, 65637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 657790 IncrementalHoareTripleChecker+Invalid, 723427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65637 mSolverCounterUnsat, 6032 mSDtfsCounter, 657790 mSolverCounterSat, 10.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134246 GetRequests, 126037 SyntacticMatches, 7273 SemanticMatches, 936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620790 ImplicationChecksByTransitivity, 126.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 20045 NumberOfCodeBlocks, 20045 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 19947 ConstructedInterpolants, 0 QuantifiedInterpolants, 156444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 98 InterpolantComputations, 26 PerfectInterpolantSequences, 18691/23730 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: 579]: 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.48ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.33ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.94ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.85ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2261.81ms. Allocated memory is still 117.4MB. Free memory was 54.3MB in the beginning and 69.7MB in the end (delta: -15.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * CodeCheck took 229941.80ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 68.9MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. * Witness Printer took 198.41ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:44:09,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed315eb-337a-4e9e-8774-32d555284205/bin/ukojak-verify-EEHR8qb7sm/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