./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.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_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/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_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/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_1a09367d-fd7f-464a-9e35-5beebb04f166/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 d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:55:18,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:55:18,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 16:55:18,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:55:18,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 16:55:18,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:55:18,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:55:18,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 16:55:18,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:55:18,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:55:18,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:55:18,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:55:18,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:55:18,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:55:18,247 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 16:55:18,247 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 16:55:18,248 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 16:55:18,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:55:18,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:55:18,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:55:18,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:55:18,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:55:18,249 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 16:55:18,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:55:18,249 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_1a09367d-fd7f-464a-9e35-5beebb04f166/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 -> d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 [2024-11-13 16:55:18,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:55:18,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:55:18,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:55:18,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:55:18,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:55:18,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c Unable to find full path for "g++" [2024-11-13 16:55:20,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:55:20,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:55:20,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-11-13 16:55:20,874 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/data/5583d2584/b42501e18b0747d09aa2a38554af1f6a/FLAG05589565b [2024-11-13 16:55:20,897 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/data/5583d2584/b42501e18b0747d09aa2a38554af1f6a [2024-11-13 16:55:20,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:55:20,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:55:20,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:55:20,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:55:20,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:55:20,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:55:20" (1/1) ... [2024-11-13 16:55:20,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4984270c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:20, skipping insertion in model container [2024-11-13 16:55:20,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:55:20" (1/1) ... [2024-11-13 16:55:20,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:55:21,366 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_1a09367d-fd7f-464a-9e35-5beebb04f166/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-13 16:55:21,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:55:21,412 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:55:21,507 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_1a09367d-fd7f-464a-9e35-5beebb04f166/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-13 16:55:21,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:55:21,552 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:55:21,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21 WrapperNode [2024-11-13 16:55:21,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:55:21,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:55:21,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:55:21,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:55:21,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,646 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 16:55:21,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:55:21,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:55:21,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:55:21,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:55:21,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:55:21,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:55:21,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:55:21,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:55:21,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:55:21" (1/1) ... [2024-11-13 16:55:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:55:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 16:55:21,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 16:55:21,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 16:55:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:55:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:55:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:55:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:55:21,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:55:21,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:55:23,143 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 16:55:23,143 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:55:23,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:55:23,509 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:55:23,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:55:23 BoogieIcfgContainer [2024-11-13 16:55:23,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:55:23,510 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 16:55:23,510 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 16:55:23,525 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 16:55:23,525 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:55:23" (1/1) ... [2024-11-13 16:55:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:55:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 16:55:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 16:55:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 16:55:23,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:24,224 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 16:55:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-13 16:55:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-13 16:55:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 16:55:24,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-13 16:55:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-13 16:55:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 16:55:26,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-13 16:55:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-13 16:55:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:55:26,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-13 16:55:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-13 16:55:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:55:26,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:55:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-13 16:55:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-13 16:55:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:55:27,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-13 16:55:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-13 16:55:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:55:27,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-13 16:55:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-13 16:55:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:55:27,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-13 16:55:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-13 16:55:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 16:55:28,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-11-13 16:55:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-11-13 16:55:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:55:29,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 418 states and 534 transitions. [2024-11-13 16:55:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 534 transitions. [2024-11-13 16:55:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:55:30,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 16:55:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-13 16:55:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-13 16:55:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:55:31,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-13 16:55:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-13 16:55:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:55:31,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 467 states and 592 transitions. [2024-11-13 16:55:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 592 transitions. [2024-11-13 16:55:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:55:32,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 473 states and 600 transitions. [2024-11-13 16:55:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 600 transitions. [2024-11-13 16:55:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:55:32,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 486 states and 615 transitions. [2024-11-13 16:55:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 615 transitions. [2024-11-13 16:55:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:55:32,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 16:55:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 507 states and 641 transitions. [2024-11-13 16:55:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 641 transitions. [2024-11-13 16:55:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:55:33,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 521 states and 658 transitions. [2024-11-13 16:55:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 658 transitions. [2024-11-13 16:55:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:55:34,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 16:55:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 536 states and 678 transitions. [2024-11-13 16:55:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 678 transitions. [2024-11-13 16:55:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 16:55:34,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:55:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 543 states and 685 transitions. [2024-11-13 16:55:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 685 transitions. [2024-11-13 16:55:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:55:35,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:55:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 574 states and 718 transitions. [2024-11-13 16:55:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 718 transitions. [2024-11-13 16:55:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:55:35,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 598 states and 750 transitions. [2024-11-13 16:55:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 750 transitions. [2024-11-13 16:55:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 16:55:36,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:55:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-13 16:55:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-13 16:55:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 16:55:36,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 680 states and 838 transitions. [2024-11-13 16:55:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 838 transitions. [2024-11-13 16:55:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:55:37,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 693 states and 854 transitions. [2024-11-13 16:55:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 854 transitions. [2024-11-13 16:55:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:55:37,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 710 states and 874 transitions. [2024-11-13 16:55:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 874 transitions. [2024-11-13 16:55:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:55:38,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 716 states and 879 transitions. [2024-11-13 16:55:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 879 transitions. [2024-11-13 16:55:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 16:55:39,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 16:55:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 740 states and 906 transitions. [2024-11-13 16:55:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 906 transitions. [2024-11-13 16:55:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 16:55:39,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 16:55:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 749 states and 916 transitions. [2024-11-13 16:55:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 916 transitions. [2024-11-13 16:55:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:55:40,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 16:55:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 768 states and 936 transitions. [2024-11-13 16:55:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 936 transitions. [2024-11-13 16:55:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 16:55:40,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 781 states and 953 transitions. [2024-11-13 16:55:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 953 transitions. [2024-11-13 16:55:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:55:41,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 812 states and 986 transitions. [2024-11-13 16:55:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 986 transitions. [2024-11-13 16:55:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:55:41,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 829 states and 1007 transitions. [2024-11-13 16:55:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1007 transitions. [2024-11-13 16:55:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:55:42,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 842 states and 1022 transitions. [2024-11-13 16:55:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1022 transitions. [2024-11-13 16:55:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:55:43,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 848 states and 1027 transitions. [2024-11-13 16:55:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1027 transitions. [2024-11-13 16:55:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:55:43,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 885 states and 1064 transitions. [2024-11-13 16:55:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1064 transitions. [2024-11-13 16:55:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:55:43,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 919 states and 1101 transitions. [2024-11-13 16:55:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1101 transitions. [2024-11-13 16:55:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:55:44,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 932 states and 1113 transitions. [2024-11-13 16:55:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1113 transitions. [2024-11-13 16:55:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:55:45,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:55:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 945 states and 1125 transitions. [2024-11-13 16:55:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1125 transitions. [2024-11-13 16:55:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:55:46,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 16:55:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 957 states and 1138 transitions. [2024-11-13 16:55:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1138 transitions. [2024-11-13 16:55:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:55:46,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:55:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 994 states and 1176 transitions. [2024-11-13 16:55:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1176 transitions. [2024-11-13 16:55:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:55:46,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:46,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:55:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1001 states and 1182 transitions. [2024-11-13 16:55:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1182 transitions. [2024-11-13 16:55:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 16:55:47,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 16:55:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1003 states and 1186 transitions. [2024-11-13 16:55:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1186 transitions. [2024-11-13 16:55:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:55:47,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 16:55:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1004 states and 1186 transitions. [2024-11-13 16:55:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1186 transitions. [2024-11-13 16:55:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:48,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 16:55:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1005 states and 1186 transitions. [2024-11-13 16:55:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1186 transitions. [2024-11-13 16:55:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 16:55:48,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 16:55:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1006 states and 1186 transitions. [2024-11-13 16:55:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1186 transitions. [2024-11-13 16:55:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 16:55:48,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 16:55:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1043 states and 1222 transitions. [2024-11-13 16:55:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1222 transitions. [2024-11-13 16:55:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 16:55:48,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 16:55:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1139 states and 1323 transitions. [2024-11-13 16:55:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1323 transitions. [2024-11-13 16:55:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 16:55:51,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 16:55:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1146 states and 1329 transitions. [2024-11-13 16:55:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1329 transitions. [2024-11-13 16:55:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-13 16:55:51,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 16:55:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1159 states and 1342 transitions. [2024-11-13 16:55:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1342 transitions. [2024-11-13 16:55:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-13 16:55:51,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 16:55:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1224 states and 1412 transitions. [2024-11-13 16:55:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1412 transitions. [2024-11-13 16:55:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-13 16:55:53,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 16:55:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1342 states and 1537 transitions. [2024-11-13 16:55:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1537 transitions. [2024-11-13 16:55:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-13 16:55:56,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 16:55:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1349 states and 1543 transitions. [2024-11-13 16:55:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1543 transitions. [2024-11-13 16:55:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-13 16:55:57,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 16:55:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1272 states and 1446 transitions. [2024-11-13 16:55:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1446 transitions. [2024-11-13 16:55:59,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:55:59,610 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 54 iterations. [2024-11-13 16:55:59,627 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 16:56:06,660 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,663 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,663 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,664 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L517-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-13 16:56:06,665 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L520-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 16:56:06,666 INFO L75 FloydHoareUtils]: For program point L521(line 521) no Hoare annotation was computed. [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,666 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,668 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,669 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,670 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,671 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,672 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,673 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,674 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 16:56:06,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 04:56:06 ImpRootNode [2024-11-13 16:56:06,686 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 16:56:06,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:56:06,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:56:06,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:56:06,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:55:23" (3/4) ... [2024-11-13 16:56:06,690 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:56:06,703 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-11-13 16:56:06,704 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 16:56:06,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 16:56:06,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:56:06,864 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 16:56:06,865 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 16:56:06,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:56:06,866 INFO L158 Benchmark]: Toolchain (without parser) took 45963.35ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 115.5MB in the beginning and 492.3MB in the end (delta: -376.8MB). Peak memory consumption was 258.1MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,866 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:56:06,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.29ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 89.7MB in the end (delta: 25.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.61ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,868 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:56:06,868 INFO L158 Benchmark]: RCFGBuilder took 1813.46ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 76.7MB in the end (delta: 4.0MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,871 INFO L158 Benchmark]: CodeCheck took 43176.24ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 75.8MB in the beginning and 504.8MB in the end (delta: -428.9MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,871 INFO L158 Benchmark]: Witness Printer took 177.59ms. Allocated memory is still 780.1MB. Free memory was 504.8MB in the beginning and 492.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:56:06,873 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71189 SdHoareTripleChecker+Valid, 230.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70720 mSDsluCounter, 10800 SdHoareTripleChecker+Invalid, 193.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9033 mSDsCounter, 25892 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162551 IncrementalHoareTripleChecker+Invalid, 188443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25892 mSolverCounterUnsat, 1767 mSDtfsCounter, 162551 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55645 GetRequests, 54177 SyntacticMatches, 1124 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60725 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 8091 NumberOfCodeBlocks, 8091 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 8038 ConstructedInterpolants, 0 QuantifiedInterpolants, 24258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 47 PerfectInterpolantSequences, 5638/5768 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: 521]: 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: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.29ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 89.7MB in the end (delta: 25.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.61ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1813.46ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 76.7MB in the end (delta: 4.0MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * CodeCheck took 43176.24ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 75.8MB in the beginning and 504.8MB in the end (delta: -428.9MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. * Witness Printer took 177.59ms. Allocated memory is still 780.1MB. Free memory was 504.8MB in the beginning and 492.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 16:56:06,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a09367d-fd7f-464a-9e35-5beebb04f166/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE