./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b --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 bea3a17da0b1932fc7b290403d6dfcc330ef29e22495436fce924ca0a1d74af7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:07:40,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:07:40,768 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:07:40,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:07:40,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:07:40,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:07:40,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:07:40,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:07:40,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:07:40,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:07:40,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:07:40,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:07:40,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:07:40,792 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:07:40,792 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:07:40,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:07:40,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:07:40,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:07:40,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:07:40,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:07:40,793 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:07:40,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:07:40,793 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_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b 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 -> bea3a17da0b1932fc7b290403d6dfcc330ef29e22495436fce924ca0a1d74af7 [2024-12-06 05:07:41,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:07:41,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:07:41,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:07:41,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:07:41,025 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:07:41,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label21.c [2024-12-06 05:07:43,651 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/data/e7d7bb85f/c9806b8beaf8453f90786ade12b68ff9/FLAGb16220461 [2024-12-06 05:07:43,932 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:07:43,933 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/sv-benchmarks/c/eca-rers2012/Problem02_label21.c [2024-12-06 05:07:43,943 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/data/e7d7bb85f/c9806b8beaf8453f90786ade12b68ff9/FLAGb16220461 [2024-12-06 05:07:44,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/data/e7d7bb85f/c9806b8beaf8453f90786ade12b68ff9 [2024-12-06 05:07:44,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:07:44,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:07:44,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:07:44,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:07:44,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:07:44,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a27d186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44, skipping insertion in model container [2024-12-06 05:07:44,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:07:44,486 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_22f33a54-6134-4879-be7a-a673fbc10e2a/sv-benchmarks/c/eca-rers2012/Problem02_label21.c[16331,16344] [2024-12-06 05:07:44,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:07:44,525 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:07:44,583 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_22f33a54-6134-4879-be7a-a673fbc10e2a/sv-benchmarks/c/eca-rers2012/Problem02_label21.c[16331,16344] [2024-12-06 05:07:44,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:07:44,612 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:07:44,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44 WrapperNode [2024-12-06 05:07:44,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:07:44,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:07:44,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:07:44,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:07:44,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,663 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 05:07:44,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:07:44,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:07:44,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:07:44,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:07:44,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:07:44,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:07:44,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:07:44,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:07:44,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:44" (1/1) ... [2024-12-06 05:07:44,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:07:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:07:44,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:07:44,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:07:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:07:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:07:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:07:44,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:07:44,834 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:07:44,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:07:45,616 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 05:07:45,616 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:07:45,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:07:45,878 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:07:45,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:45 BoogieIcfgContainer [2024-12-06 05:07:45,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:07:45,879 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:07:45,879 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:07:45,888 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:07:45,888 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:45" (1/1) ... [2024-12-06 05:07:45,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:07:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 05:07:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 05:07:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 05:07:45,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 05:07:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 05:07:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 05:07:46,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 05:07:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 05:07:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:07:47,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 05:07:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 05:07:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 05:07:48,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 05:07:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 05:07:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:07:48,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:07:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 05:07:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 05:07:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 05:07:48,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 05:07:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 05:07:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:07:48,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 05:07:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 05:07:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 05:07:48,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 05:07:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 05:07:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 05:07:49,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-12-06 05:07:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-12-06 05:07:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:07:50,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 418 states and 534 transitions. [2024-12-06 05:07:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 534 transitions. [2024-12-06 05:07:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:07:50,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:07:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-12-06 05:07:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-12-06 05:07:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:07:51,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 442 states and 560 transitions. [2024-12-06 05:07:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 560 transitions. [2024-12-06 05:07:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:07:51,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 449 states and 567 transitions. [2024-12-06 05:07:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 567 transitions. [2024-12-06 05:07:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:07:51,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 05:07:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 455 states and 575 transitions. [2024-12-06 05:07:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 575 transitions. [2024-12-06 05:07:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 05:07:51,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 468 states and 590 transitions. [2024-12-06 05:07:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 590 transitions. [2024-12-06 05:07:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:07:52,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 490 states and 619 transitions. [2024-12-06 05:07:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 619 transitions. [2024-12-06 05:07:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 05:07:52,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:07:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 505 states and 637 transitions. [2024-12-06 05:07:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 637 transitions. [2024-12-06 05:07:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:07:53,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:07:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 536 states and 670 transitions. [2024-12-06 05:07:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 670 transitions. [2024-12-06 05:07:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 05:07:53,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 560 states and 702 transitions. [2024-12-06 05:07:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 702 transitions. [2024-12-06 05:07:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:07:54,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:07:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 563 states and 705 transitions. [2024-12-06 05:07:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 705 transitions. [2024-12-06 05:07:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:07:54,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 05:07:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 686 states and 834 transitions. [2024-12-06 05:07:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 834 transitions. [2024-12-06 05:07:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:07:55,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 699 states and 850 transitions. [2024-12-06 05:07:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 850 transitions. [2024-12-06 05:07:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:07:55,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 730 states and 893 transitions. [2024-12-06 05:07:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 893 transitions. [2024-12-06 05:07:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:07:56,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 736 states and 900 transitions. [2024-12-06 05:07:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 900 transitions. [2024-12-06 05:07:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:07:56,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 767 states and 935 transitions. [2024-12-06 05:07:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 935 transitions. [2024-12-06 05:07:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:07:57,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 780 states and 948 transitions. [2024-12-06 05:07:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 948 transitions. [2024-12-06 05:07:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 05:07:57,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:07:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 793 states and 960 transitions. [2024-12-06 05:07:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 960 transitions. [2024-12-06 05:07:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:07:57,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 05:07:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 838 states and 1009 transitions. [2024-12-06 05:07:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1009 transitions. [2024-12-06 05:07:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:07:58,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 05:07:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 840 states and 1012 transitions. [2024-12-06 05:07:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1012 transitions. [2024-12-06 05:07:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 05:07:58,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 05:07:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 841 states and 1012 transitions. [2024-12-06 05:07:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1012 transitions. [2024-12-06 05:07:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-06 05:07:58,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:07:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 879 states and 1056 transitions. [2024-12-06 05:07:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1056 transitions. [2024-12-06 05:07:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 05:07:59,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-06 05:07:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 898 states and 1075 transitions. [2024-12-06 05:07:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1075 transitions. [2024-12-06 05:07:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 05:07:59,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-06 05:08:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 924 states and 1106 transitions. [2024-12-06 05:08:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1106 transitions. [2024-12-06 05:08:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:08:00,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 05:08:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 925 states and 1106 transitions. [2024-12-06 05:08:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1106 transitions. [2024-12-06 05:08:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 05:08:00,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:08:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 928 states and 1109 transitions. [2024-12-06 05:08:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1109 transitions. [2024-12-06 05:08:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:08:00,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 05:08:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 999 states and 1184 transitions. [2024-12-06 05:08:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1184 transitions. [2024-12-06 05:08:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:08:02,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 05:08:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1000 states and 1184 transitions. [2024-12-06 05:08:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1184 transitions. [2024-12-06 05:08:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:08:02,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 05:08:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1001 states and 1184 transitions. [2024-12-06 05:08:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1184 transitions. [2024-12-06 05:08:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:08:02,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:08:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1039 states and 1222 transitions. [2024-12-06 05:08:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1222 transitions. [2024-12-06 05:08:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 05:08:02,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:08:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1221 states and 1408 transitions. [2024-12-06 05:08:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1408 transitions. [2024-12-06 05:08:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 05:08:06,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:06,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 05:08:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1248 states and 1436 transitions. [2024-12-06 05:08:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1436 transitions. [2024-12-06 05:08:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 05:08:07,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 05:08:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1249 states and 1436 transitions. [2024-12-06 05:08:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1436 transitions. [2024-12-06 05:08:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 05:08:07,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1258 states and 1446 transitions. [2024-12-06 05:08:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1446 transitions. [2024-12-06 05:08:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:08:07,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-12-06 05:08:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1271 states and 1459 transitions. [2024-12-06 05:08:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1459 transitions. [2024-12-06 05:08:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-12-06 05:08:07,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-12-06 05:08:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1305 states and 1495 transitions. [2024-12-06 05:08:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1495 transitions. [2024-12-06 05:08:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 05:08:08,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1337 states and 1530 transitions. [2024-12-06 05:08:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1530 transitions. [2024-12-06 05:08:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-12-06 05:08:08,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-12-06 05:08:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1370 states and 1563 transitions. [2024-12-06 05:08:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1563 transitions. [2024-12-06 05:08:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-12-06 05:08:09,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-12-06 05:08:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1374 states and 1566 transitions. [2024-12-06 05:08:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1566 transitions. [2024-12-06 05:08:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-06 05:08:09,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1406 states and 1601 transitions. [2024-12-06 05:08:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1601 transitions. [2024-12-06 05:08:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:08:09,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1476 states and 1681 transitions. [2024-12-06 05:08:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1681 transitions. [2024-12-06 05:08:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:08:10,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 179 proven. 8 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1528 states and 1735 transitions. [2024-12-06 05:08:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1735 transitions. [2024-12-06 05:08:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:08:11,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 05:08:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1561 states and 1772 transitions. [2024-12-06 05:08:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1772 transitions. [2024-12-06 05:08:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 05:08:12,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-06 05:08:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1634 states and 1853 transitions. [2024-12-06 05:08:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1853 transitions. [2024-12-06 05:08:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 05:08:13,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-06 05:08:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1644 states and 1862 transitions. [2024-12-06 05:08:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1862 transitions. [2024-12-06 05:08:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:08:13,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-12-06 05:08:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1647 states and 1865 transitions. [2024-12-06 05:08:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1865 transitions. [2024-12-06 05:08:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:08:14,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-12-06 05:08:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1678 states and 1903 transitions. [2024-12-06 05:08:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1903 transitions. [2024-12-06 05:08:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:08:14,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-12-06 05:08:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1692 states and 1917 transitions. [2024-12-06 05:08:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 1917 transitions. [2024-12-06 05:08:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:08:15,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:08:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1705 states and 1933 transitions. [2024-12-06 05:08:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1933 transitions. [2024-12-06 05:08:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:08:15,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-12-06 05:08:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1742 states and 1973 transitions. [2024-12-06 05:08:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1973 transitions. [2024-12-06 05:08:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:08:16,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-12-06 05:08:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1745 states and 1976 transitions. [2024-12-06 05:08:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 1976 transitions. [2024-12-06 05:08:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:08:16,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:16,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 219 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-06 05:08:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1760 states and 1991 transitions. [2024-12-06 05:08:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 1991 transitions. [2024-12-06 05:08:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:08:17,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 259 proven. 16 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1779 states and 2011 transitions. [2024-12-06 05:08:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2011 transitions. [2024-12-06 05:08:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:08:17,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 259 proven. 16 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1792 states and 2024 transitions. [2024-12-06 05:08:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2024 transitions. [2024-12-06 05:08:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:08:18,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 259 proven. 16 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 05:08:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1798 states and 2029 transitions. [2024-12-06 05:08:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2029 transitions. [2024-12-06 05:08:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:08:18,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-12-06 05:08:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1880 states and 2127 transitions. [2024-12-06 05:08:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2127 transitions. [2024-12-06 05:08:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:08:20,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-12-06 05:08:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1881 states and 2127 transitions. [2024-12-06 05:08:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2127 transitions. [2024-12-06 05:08:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:08:20,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-12-06 05:08:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1882 states and 2134 transitions. [2024-12-06 05:08:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2134 transitions. [2024-12-06 05:08:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:08:21,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-12-06 05:08:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1892 states and 2145 transitions. [2024-12-06 05:08:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2145 transitions. [2024-12-06 05:08:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-12-06 05:08:21,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 05:08:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 1915 states and 2171 transitions. [2024-12-06 05:08:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2171 transitions. [2024-12-06 05:08:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:08:22,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 05:08:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1994 states and 2258 transitions. [2024-12-06 05:08:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2258 transitions. [2024-12-06 05:08:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:08:23,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-12-06 05:08:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1995 states and 2258 transitions. [2024-12-06 05:08:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2258 transitions. [2024-12-06 05:08:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-12-06 05:08:24,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-12-06 05:08:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2153 states and 2426 transitions. [2024-12-06 05:08:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2426 transitions. [2024-12-06 05:08:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-12-06 05:08:26,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-12-06 05:08:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2193 states and 2469 transitions. [2024-12-06 05:08:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2469 transitions. [2024-12-06 05:08:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-12-06 05:08:27,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-12-06 05:08:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2213 states and 2488 transitions. [2024-12-06 05:08:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2488 transitions. [2024-12-06 05:08:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-12-06 05:08:27,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-12-06 05:08:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2263 states and 2541 transitions. [2024-12-06 05:08:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2541 transitions. [2024-12-06 05:08:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-12-06 05:08:28,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-12-06 05:08:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2295 states and 2574 transitions. [2024-12-06 05:08:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2574 transitions. [2024-12-06 05:08:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-12-06 05:08:29,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 402 proven. 79 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-06 05:08:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2375 states and 2674 transitions. [2024-12-06 05:08:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2674 transitions. [2024-12-06 05:08:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-12-06 05:08:31,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-06 05:08:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2454 states and 2753 transitions. [2024-12-06 05:08:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2753 transitions. [2024-12-06 05:08:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-12-06 05:08:32,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-06 05:08:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2457 states and 2755 transitions. [2024-12-06 05:08:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 2755 transitions. [2024-12-06 05:08:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-12-06 05:08:32,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-12-06 05:08:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2499 states and 2800 transitions. [2024-12-06 05:08:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 2800 transitions. [2024-12-06 05:08:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-12-06 05:08:33,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-12-06 05:08:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2521 states and 2822 transitions. [2024-12-06 05:08:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 2822 transitions. [2024-12-06 05:08:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-12-06 05:08:34,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-12-06 05:08:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2535 states and 2835 transitions. [2024-12-06 05:08:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 2835 transitions. [2024-12-06 05:08:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-12-06 05:08:34,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-12-06 05:08:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2557 states and 2857 transitions. [2024-12-06 05:08:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 2857 transitions. [2024-12-06 05:08:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-12-06 05:08:35,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-12-06 05:08:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2271 states and 2555 transitions. [2024-12-06 05:08:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2555 transitions. [2024-12-06 05:08:36,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:08:36,218 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 85 iterations. [2024-12-06 05:08:36,224 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:08:46,196 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,197 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,198 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,199 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,200 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,201 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L466-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L469-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L75 FloydHoareUtils]: For program point L470(line 470) no Hoare annotation was computed. [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,202 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,203 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,204 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,205 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a17~0))) (.cse1 (not (= ~a11~0 1)))) (or (<= 9 ~a28~0) (and .cse0 (<= ~a17~0 7) .cse1) (and (= ~a25~0 1) .cse0) (and (<= ~a17~0 8) (< 7 ~a17~0) .cse1) (<= ~a28~0 7))) [2024-12-06 05:08:46,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:08:46 ImpRootNode [2024-12-06 05:08:46,214 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:08:46,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:08:46,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:08:46,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:08:46,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:45" (3/4) ... [2024-12-06 05:08:46,217 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:08:46,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2024-12-06 05:08:46,230 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 05:08:46,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 05:08:46,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:08:46,328 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:08:46,328 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:08:46,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:08:46,329 INFO L158 Benchmark]: Toolchain (without parser) took 62082.04ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 91.7MB in the beginning and 919.3MB in the end (delta: -827.6MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,329 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:08:46,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.33ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 65.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.26ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 60.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,330 INFO L158 Benchmark]: Boogie Preprocessor took 49.53ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:08:46,330 INFO L158 Benchmark]: RCFGBuilder took 1163.63ms. Allocated memory is still 117.4MB. Free memory was 56.3MB in the beginning and 30.7MB in the end (delta: 25.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,331 INFO L158 Benchmark]: CodeCheck took 60335.44ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 30.7MB in the beginning and 931.9MB in the end (delta: -901.1MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,331 INFO L158 Benchmark]: Witness Printer took 113.68ms. Allocated memory is still 1.1GB. Free memory was 931.9MB in the beginning and 919.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:08:46,333 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: 50.3s, OverallIterations: 85, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208041 SdHoareTripleChecker+Valid, 424.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207293 mSDsluCounter, 25548 SdHoareTripleChecker+Invalid, 356.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21692 mSDsCounter, 53565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454710 IncrementalHoareTripleChecker+Invalid, 508275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53565 mSolverCounterUnsat, 3856 mSDtfsCounter, 454710 mSolverCounterSat, 3.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113813 GetRequests, 110383 SyntacticMatches, 2864 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204722 ImplicationChecksByTransitivity, 27.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 17404 NumberOfCodeBlocks, 17404 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 17320 ConstructedInterpolants, 0 QuantifiedInterpolants, 41606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 75 PerfectInterpolantSequences, 20959/21271 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, ConComCheckerStatistics: No data available - PositiveResult [Line: 470]: 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: (((((9 <= a28) || (((7 != a17) && (a17 <= 7)) && (a11 != 1))) || ((a25 == 1) && (7 != a17))) || (((a17 <= 8) && (7 < a17)) && (a11 != 1))) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((9 <= a28) || (((7 != a17) && (a17 <= 7)) && (a11 != 1))) || ((a25 == 1) && (7 != a17))) || (((a17 <= 8) && (7 < a17)) && (a11 != 1))) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.33ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 65.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.26ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 60.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.53ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1163.63ms. Allocated memory is still 117.4MB. Free memory was 56.3MB in the beginning and 30.7MB in the end (delta: 25.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * CodeCheck took 60335.44ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 30.7MB in the beginning and 931.9MB in the end (delta: -901.1MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 113.68ms. Allocated memory is still 1.1GB. Free memory was 931.9MB in the beginning and 919.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 05:08:46,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f33a54-6134-4879-be7a-a673fbc10e2a/bin/ukojak-verify-CZk0znPC7b/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