./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/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_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/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_f540a320-a7da-4850-ba3f-940df480d821/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 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:27:53,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:27:53,563 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:27:53,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:27:53,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:27:53,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:27:53,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:27:53,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:27:53,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:27:53,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:27:53,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:27:53,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:27:53,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:27:53,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:27:53,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:27:53,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:27:53,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:27:53,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:27:53,613 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:27:53,614 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:27:53,614 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:27:53,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:27:53,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:27:53,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:27:53,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:27:53,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:27:53,615 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:27:53,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:27:53,615 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_f540a320-a7da-4850-ba3f-940df480d821/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 -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2024-11-13 22:27:53,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:27:53,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:27:53,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:27:53,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:27:53,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:27:53,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c Unable to find full path for "g++" [2024-11-13 22:27:55,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:27:56,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:27:56,255 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-11-13 22:27:56,276 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/data/b3d6898f7/e9e80a6aa79845c58fe5dd9380a6ca5b/FLAG3ca35dec9 [2024-11-13 22:27:56,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/data/b3d6898f7/e9e80a6aa79845c58fe5dd9380a6ca5b [2024-11-13 22:27:56,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:27:56,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:27:56,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:27:56,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:27:56,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:27:56,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:27:56" (1/1) ... [2024-11-13 22:27:56,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3545f2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:56, skipping insertion in model container [2024-11-13 22:27:56,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:27:56" (1/1) ... [2024-11-13 22:27:56,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:27:56,820 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_f540a320-a7da-4850-ba3f-940df480d821/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-13 22:27:56,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:27:56,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:27:56,992 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_f540a320-a7da-4850-ba3f-940df480d821/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-13 22:27:57,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:27:57,042 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:27:57,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57 WrapperNode [2024-11-13 22:27:57,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:27:57,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:27:57,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:27:57,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:27:57,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,144 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 22:27:57,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:27:57,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:27:57,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:27:57,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:27:57,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:27:57,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:27:57,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:27:57,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:27:57,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:27:57" (1/1) ... [2024-11-13 22:27:57,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:27:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:27:57,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:27:57,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:27:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:27:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:27:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:27:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:27:57,394 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:27:57,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:27:58,739 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 22:27:58,739 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:27:59,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:27:59,057 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:27:59,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:27:59 BoogieIcfgContainer [2024-11-13 22:27:59,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:27:59,058 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:27:59,058 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:27:59,068 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:27:59,068 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:27:59" (1/1) ... [2024-11-13 22:27:59,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:27:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:27:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 22:27:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 22:27:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:27:59,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:27:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:27:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:00,260 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 22:28:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-13 22:28:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-13 22:28:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:28:01,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:01,372 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 22:28:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-13 22:28:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-13 22:28:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:28:02,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:02,995 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 22:28:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-13 22:28:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-13 22:28:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 22:28:04,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:04,455 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 22:28:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-13 22:28:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-13 22:28:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 22:28:05,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:05,420 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 22:28:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-13 22:28:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-13 22:28:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:28:05,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:06,055 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 22:28:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-13 22:28:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-13 22:28:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 22:28:06,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:06,536 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 22:28:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-13 22:28:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-13 22:28:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:28:07,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:08,128 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 22:28:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-13 22:28:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-13 22:28:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:28:08,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:09,239 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 22:28:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-13 22:28:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-13 22:28:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 22:28:09,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:10,327 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 22:28:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-13 22:28:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-13 22:28:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 22:28:11,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:12,148 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 22:28:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-13 22:28:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-13 22:28:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:28:12,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:12,808 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 22:28:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-13 22:28:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-13 22:28:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:28:14,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:15,178 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 22:28:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-13 22:28:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-13 22:28:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:28:15,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 22:28:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-13 22:28:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-13 22:28:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:28:16,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:16,383 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 22:28:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-13 22:28:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-13 22:28:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:28:16,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:16,985 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 22:28:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-13 22:28:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-13 22:28:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:28:19,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:19,375 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 22:28:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-13 22:28:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-13 22:28:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:28:20,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:20,914 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 22:28:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-13 22:28:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-13 22:28:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:28:21,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:21,417 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 22:28:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-13 22:28:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-13 22:28:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 22:28:21,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:21,866 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 22:28:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-13 22:28:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-13 22:28:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 22:28:23,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:23,179 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 22:28:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-13 22:28:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-13 22:28:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:28:23,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:28:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 686 states and 833 transitions. [2024-11-13 22:28:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 833 transitions. [2024-11-13 22:28:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:28:25,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:25,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:28:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 688 states and 834 transitions. [2024-11-13 22:28:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 834 transitions. [2024-11-13 22:28:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:28:26,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:26,467 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 22:28:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 735 states and 897 transitions. [2024-11-13 22:28:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 897 transitions. [2024-11-13 22:28:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:28:27,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:27,750 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 22:28:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 769 states and 939 transitions. [2024-11-13 22:28:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 939 transitions. [2024-11-13 22:28:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 22:28:28,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:29,452 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 22:28:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 853 states and 1034 transitions. [2024-11-13 22:28:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1034 transitions. [2024-11-13 22:28:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:28:32,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:33,582 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 22:28:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 905 states and 1100 transitions. [2024-11-13 22:28:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1100 transitions. [2024-11-13 22:28:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:28:35,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:35,851 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 22:28:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 967 states and 1173 transitions. [2024-11-13 22:28:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1173 transitions. [2024-11-13 22:28:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:28:37,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:38,560 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 22:28:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 969 states and 1174 transitions. [2024-11-13 22:28:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1174 transitions. [2024-11-13 22:28:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:28:38,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:39,752 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 22:28:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1062 states and 1287 transitions. [2024-11-13 22:28:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1287 transitions. [2024-11-13 22:28:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:28:42,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:43,166 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 22:28:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1066 states and 1292 transitions. [2024-11-13 22:28:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1292 transitions. [2024-11-13 22:28:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:28:43,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:28:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1101 states and 1336 transitions. [2024-11-13 22:28:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1336 transitions. [2024-11-13 22:28:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:28:45,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:46,270 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 22:28:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1116 states and 1355 transitions. [2024-11-13 22:28:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1355 transitions. [2024-11-13 22:28:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 22:28:46,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:46,947 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 22:28:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1186 states and 1427 transitions. [2024-11-13 22:28:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1427 transitions. [2024-11-13 22:28:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:28:49,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:49,732 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 22:28:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1253 states and 1505 transitions. [2024-11-13 22:28:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1505 transitions. [2024-11-13 22:28:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:28:51,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:52,123 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 22:28:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1283 states and 1539 transitions. [2024-11-13 22:28:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1539 transitions. [2024-11-13 22:28:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:28:52,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:53,377 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 22:28:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1341 states and 1611 transitions. [2024-11-13 22:28:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1611 transitions. [2024-11-13 22:28:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:28:54,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:54,803 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 22:28:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1343 states and 1612 transitions. [2024-11-13 22:28:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1612 transitions. [2024-11-13 22:28:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 22:28:55,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:55,324 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 22:28:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1381 states and 1655 transitions. [2024-11-13 22:28:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1655 transitions. [2024-11-13 22:28:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:28:56,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:28:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1405 states and 1681 transitions. [2024-11-13 22:28:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1681 transitions. [2024-11-13 22:28:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:28:57,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:28:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:28:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1418 states and 1695 transitions. [2024-11-13 22:28:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1695 transitions. [2024-11-13 22:28:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:28:58,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:28:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:28:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:28:59,077 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 22:29:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1439 states and 1723 transitions. [2024-11-13 22:29:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1723 transitions. [2024-11-13 22:29:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:29:00,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:00,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:00,811 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 22:29:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1441 states and 1727 transitions. [2024-11-13 22:29:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1727 transitions. [2024-11-13 22:29:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:29:00,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:01,273 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 22:29:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1473 states and 1759 transitions. [2024-11-13 22:29:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1759 transitions. [2024-11-13 22:29:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:29:03,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:29:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1498 states and 1788 transitions. [2024-11-13 22:29:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1788 transitions. [2024-11-13 22:29:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:29:06,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:06,980 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 22:29:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1531 states and 1826 transitions. [2024-11-13 22:29:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1826 transitions. [2024-11-13 22:29:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:29:09,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:09,316 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 22:29:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1532 states and 1826 transitions. [2024-11-13 22:29:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1826 transitions. [2024-11-13 22:29:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:29:09,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:09,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:10,090 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 22:29:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1533 states and 1826 transitions. [2024-11-13 22:29:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1826 transitions. [2024-11-13 22:29:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:29:10,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:11,237 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 22:29:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1580 states and 1892 transitions. [2024-11-13 22:29:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1892 transitions. [2024-11-13 22:29:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:29:14,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:14,591 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 22:29:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1592 states and 1902 transitions. [2024-11-13 22:29:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1902 transitions. [2024-11-13 22:29:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:29:15,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:15,950 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 22:29:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1607 states and 1916 transitions. [2024-11-13 22:29:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1916 transitions. [2024-11-13 22:29:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:29:17,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:17,482 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 22:29:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1610 states and 1919 transitions. [2024-11-13 22:29:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1919 transitions. [2024-11-13 22:29:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 22:29:17,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:18,488 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 22:29:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1744 states and 2068 transitions. [2024-11-13 22:29:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2068 transitions. [2024-11-13 22:29:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:29:22,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:23,227 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 22:29:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1769 states and 2094 transitions. [2024-11-13 22:29:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2094 transitions. [2024-11-13 22:29:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:29:24,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:24,886 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 22:29:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1782 states and 2108 transitions. [2024-11-13 22:29:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2108 transitions. [2024-11-13 22:29:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:29:25,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:26,327 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 22:29:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1785 states and 2112 transitions. [2024-11-13 22:29:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2112 transitions. [2024-11-13 22:29:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 22:29:26,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:27,457 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 22:29:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1873 states and 2218 transitions. [2024-11-13 22:29:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2218 transitions. [2024-11-13 22:29:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 22:29:31,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:31,905 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 22:29:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 1947 states and 2294 transitions. [2024-11-13 22:29:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2294 transitions. [2024-11-13 22:29:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 22:29:33,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:34,235 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 22:29:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1968 states and 2316 transitions. [2024-11-13 22:29:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2316 transitions. [2024-11-13 22:29:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 22:29:35,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:36,394 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 22:29:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1970 states and 2318 transitions. [2024-11-13 22:29:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2318 transitions. [2024-11-13 22:29:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:29:36,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:36,979 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 22:29:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 1985 states and 2335 transitions. [2024-11-13 22:29:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2335 transitions. [2024-11-13 22:29:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 22:29:37,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:37,911 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 22:29:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2022 states and 2380 transitions. [2024-11-13 22:29:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2380 transitions. [2024-11-13 22:29:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:29:39,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:39,922 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 22:29:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2033 states and 2392 transitions. [2024-11-13 22:29:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2392 transitions. [2024-11-13 22:29:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 22:29:40,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:29:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2036 states and 2396 transitions. [2024-11-13 22:29:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2396 transitions. [2024-11-13 22:29:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 22:29:41,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:29:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2041 states and 2401 transitions. [2024-11-13 22:29:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2401 transitions. [2024-11-13 22:29:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:29:43,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:43,464 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 22:29:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2055 states and 2417 transitions. [2024-11-13 22:29:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2417 transitions. [2024-11-13 22:29:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:29:44,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:44,599 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 22:29:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2096 states and 2465 transitions. [2024-11-13 22:29:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2465 transitions. [2024-11-13 22:29:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 22:29:46,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:46,693 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 22:29:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2135 states and 2520 transitions. [2024-11-13 22:29:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2520 transitions. [2024-11-13 22:29:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:29:50,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:50,439 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 22:29:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2149 states and 2535 transitions. [2024-11-13 22:29:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2535 transitions. [2024-11-13 22:29:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:29:51,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:51,506 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 22:29:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2152 states and 2538 transitions. [2024-11-13 22:29:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2538 transitions. [2024-11-13 22:29:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:29:52,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:52,380 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 22:29:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2164 states and 2554 transitions. [2024-11-13 22:29:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2554 transitions. [2024-11-13 22:29:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:29:54,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:54,174 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 22:29:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2166 states and 2556 transitions. [2024-11-13 22:29:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2556 transitions. [2024-11-13 22:29:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:29:54,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:54,986 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 22:29:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2178 states and 2570 transitions. [2024-11-13 22:29:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2570 transitions. [2024-11-13 22:29:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:29:55,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:56,070 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 22:29:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2179 states and 2570 transitions. [2024-11-13 22:29:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2570 transitions. [2024-11-13 22:29:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:29:56,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:29:56,654 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 22:30:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2224 states and 2623 transitions. [2024-11-13 22:30:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2623 transitions. [2024-11-13 22:30:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:30:01,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:01,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:01,550 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 22:30:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2293 states and 2709 transitions. [2024-11-13 22:30:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2709 transitions. [2024-11-13 22:30:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:30:06,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:07,065 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 22:30:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2295 states and 2710 transitions. [2024-11-13 22:30:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2710 transitions. [2024-11-13 22:30:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:30:07,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:08,177 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 22:30:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2298 states and 2714 transitions. [2024-11-13 22:30:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2714 transitions. [2024-11-13 22:30:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:30:09,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:09,480 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 22:30:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2307 states and 2723 transitions. [2024-11-13 22:30:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2723 transitions. [2024-11-13 22:30:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:30:09,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:10,024 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 22:30:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2331 states and 2749 transitions. [2024-11-13 22:30:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2749 transitions. [2024-11-13 22:30:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:30:10,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:11,438 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 22:30:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2408 states and 2844 transitions. [2024-11-13 22:30:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2844 transitions. [2024-11-13 22:30:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:30:17,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:17,555 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 22:30:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2412 states and 2848 transitions. [2024-11-13 22:30:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2848 transitions. [2024-11-13 22:30:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:30:18,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:30:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2427 states and 2872 transitions. [2024-11-13 22:30:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2872 transitions. [2024-11-13 22:30:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:30:22,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:30:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2429 states and 2873 transitions. [2024-11-13 22:30:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2873 transitions. [2024-11-13 22:30:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:30:23,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:30:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2434 states and 2882 transitions. [2024-11-13 22:30:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2882 transitions. [2024-11-13 22:30:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 22:30:25,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:25,823 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 22:30:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2437 states and 2888 transitions. [2024-11-13 22:30:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2888 transitions. [2024-11-13 22:30:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:26,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:26,893 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 22:30:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2448 states and 2901 transitions. [2024-11-13 22:30:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2901 transitions. [2024-11-13 22:30:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:28,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:29,442 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 22:30:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2524 states and 2984 transitions. [2024-11-13 22:30:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 2984 transitions. [2024-11-13 22:30:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:37,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:38,452 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 22:30:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 2571 states and 3032 transitions. [2024-11-13 22:30:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3032 transitions. [2024-11-13 22:30:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:43,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:43,262 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 22:30:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2574 states and 3043 transitions. [2024-11-13 22:30:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3043 transitions. [2024-11-13 22:30:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:44,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:44,728 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 22:30:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2575 states and 3043 transitions. [2024-11-13 22:30:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3043 transitions. [2024-11-13 22:30:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:30:45,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:45,598 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 22:30:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2576 states and 3043 transitions. [2024-11-13 22:30:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3043 transitions. [2024-11-13 22:30:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 22:30:46,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:46,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:46,737 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 22:30:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 2583 states and 3050 transitions. [2024-11-13 22:30:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3050 transitions. [2024-11-13 22:30:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 22:30:46,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:30:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 2606 states and 3081 transitions. [2024-11-13 22:30:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3081 transitions. [2024-11-13 22:30:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 22:30:50,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:50,873 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 22:30:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 2637 states and 3114 transitions. [2024-11-13 22:30:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3114 transitions. [2024-11-13 22:30:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:30:54,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:54,936 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 22:30:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 2640 states and 3118 transitions. [2024-11-13 22:30:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3118 transitions. [2024-11-13 22:30:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:30:55,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:55,630 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 22:30:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 2651 states and 3134 transitions. [2024-11-13 22:30:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3134 transitions. [2024-11-13 22:30:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:30:57,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:31:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 2663 states and 3149 transitions. [2024-11-13 22:31:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3149 transitions. [2024-11-13 22:31:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:31:00,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:00,698 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 22:31:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 2788 states and 3298 transitions. [2024-11-13 22:31:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3298 transitions. [2024-11-13 22:31:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:31:10,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:11,051 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 22:31:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 2849 states and 3367 transitions. [2024-11-13 22:31:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3367 transitions. [2024-11-13 22:31:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:31:15,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:15,693 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 22:31:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 2854 states and 3373 transitions. [2024-11-13 22:31:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3373 transitions. [2024-11-13 22:31:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 22:31:16,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:16,492 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 22:31:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 2855 states and 3373 transitions. [2024-11-13 22:31:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3373 transitions. [2024-11-13 22:31:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 22:31:16,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:17,599 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 22:31:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 2907 states and 3422 transitions. [2024-11-13 22:31:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3422 transitions. [2024-11-13 22:31:22,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:31:22,132 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 104 iterations. [2024-11-13 22:31:22,143 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 22:32:04,282 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,282 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 22:32:04,282 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 22:32:04,283 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 22:32:04,283 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 22:32:04,283 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 22:32:04,283 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-13 22:32:04,284 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 22:32:04,284 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-13 22:32:04,284 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 22:32:04,284 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,285 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 22:32:04,285 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 22:32:04,286 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 22:32:04,286 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-13 22:32:04,286 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 22:32:04,287 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 22:32:04,287 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 22:32:04,287 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 22:32:04,287 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 22:32:04,288 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 22:32:04,288 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 22:32:04,288 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 22:32:04,288 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,289 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 22:32:04,289 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-13 22:32:04,289 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 22:32:04,290 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-13 22:32:04,290 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 22:32:04,290 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 22:32:04,290 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 22:32:04,291 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-13 22:32:04,291 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 22:32:04,291 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 22:32:04,291 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 22:32:04,292 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,292 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 22:32:04,292 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 22:32:04,292 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-13 22:32:04,292 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 22:32:04,293 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 22:32:04,293 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 22:32:04,293 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 22:32:04,293 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 22:32:04,294 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-13 22:32:04,294 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 22:32:04,294 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 22:32:04,294 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:32:04,294 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,295 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 22:32:04,295 INFO L77 FloydHoareUtils]: At program point L488-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 22:32:04,295 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 22:32:04,295 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 22:32:04,295 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 22:32:04,295 INFO L75 FloydHoareUtils]: For program point L489(line 489) no Hoare annotation was computed. [2024-11-13 22:32:04,296 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,296 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 22:32:04,296 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 22:32:04,296 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 22:32:04,296 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:32:04,297 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 22:32:04,297 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 22:32:04,297 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,297 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 22:32:04,297 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 22:32:04,298 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-13 22:32:04,298 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 22:32:04,298 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 22:32:04,298 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 22:32:04,299 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 489) no Hoare annotation was computed. [2024-11-13 22:32:04,299 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 22:32:04,299 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 22:32:04,299 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 22:32:04,299 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 22:32:04,300 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 22:32:04,300 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse12 (= 14 ~a8~0)) (.cse11 (= ~a7~0 0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4)) (.cse5 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse11 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse6) (and .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse10 (not .cse11) .cse13) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9) (and .cse10 (not (and .cse5 .cse13 (= ~a17~0 ~a7~0))) .cse6)))) [2024-11-13 22:32:04,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:32:04 ImpRootNode [2024-11-13 22:32:04,324 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:32:04,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:32:04,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:32:04,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:32:04,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:27:59" (3/4) ... [2024-11-13 22:32:04,328 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:32:04,346 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-13 22:32:04,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 22:32:04,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 22:32:04,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:32:04,505 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:32:04,505 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:32:04,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:32:04,506 INFO L158 Benchmark]: Toolchain (without parser) took 248206.49ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 92.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 633.9MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,506 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:32:04,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.20ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 65.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.85ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,507 INFO L158 Benchmark]: Boogie Preprocessor took 69.36ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:32:04,508 INFO L158 Benchmark]: RCFGBuilder took 1841.49ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 72.0MB in the end (delta: -16.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,508 INFO L158 Benchmark]: CodeCheck took 245266.24ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 72.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 606.0MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,508 INFO L158 Benchmark]: Witness Printer took 180.67ms. Allocated memory is still 2.6GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:32:04,510 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: 203.0s, OverallIterations: 104, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334832 SdHoareTripleChecker+Valid, 1032.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333912 mSDsluCounter, 43492 SdHoareTripleChecker+Invalid, 892.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36947 mSDsCounter, 69472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725061 IncrementalHoareTripleChecker+Invalid, 794533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69472 mSolverCounterUnsat, 6545 mSDtfsCounter, 725061 mSolverCounterSat, 9.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142002 GetRequests, 133290 SyntacticMatches, 7668 SemanticMatches, 1044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776684 ImplicationChecksByTransitivity, 140.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 21050 NumberOfCodeBlocks, 21050 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 20947 ConstructedInterpolants, 0 QuantifiedInterpolants, 163442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 24 PerfectInterpolantSequences, 19494/24741 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 489]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.20ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 65.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.85ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.36ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1841.49ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 72.0MB in the end (delta: -16.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * CodeCheck took 245266.24ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 72.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 606.0MB. Max. memory is 16.1GB. * Witness Printer took 180.67ms. Allocated memory is still 2.6GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 22:32:04,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f540a320-a7da-4850-ba3f-940df480d821/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE