./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:20:59,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:20:59,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:20:59,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:20:59,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:20:59,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:20:59,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:20:59,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:20:59,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:20:59,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:20:59,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:20:59,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:20:59,341 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:20:59,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:20:59,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:20:59,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:20:59,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:20:59,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:20:59,342 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:20:59,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:20:59,342 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_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2024-11-13 22:20:59,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:20:59,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:20:59,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:20:59,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:20:59,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:20:59,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c Unable to find full path for "g++" [2024-11-13 22:21:01,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:21:02,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:21:02,083 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-11-13 22:21:02,103 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/data/21abf4cc6/07fdec9afd0144c2847026be9c326376/FLAG6429c2c6d [2024-11-13 22:21:02,135 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/data/21abf4cc6/07fdec9afd0144c2847026be9c326376 [2024-11-13 22:21:02,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:21:02,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:21:02,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:21:02,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:21:02,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:21:02,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b898c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02, skipping insertion in model container [2024-11-13 22:21:02,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:21:02,519 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_0765ceac-406d-4c29-aab9-4d20e695772a/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-13 22:21:02,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:21:02,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:21:02,683 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_0765ceac-406d-4c29-aab9-4d20e695772a/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-13 22:21:02,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:21:02,719 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:21:02,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02 WrapperNode [2024-11-13 22:21:02,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:21:02,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:21:02,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:21:02,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:21:02,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,791 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 22:21:02,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:21:02,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:21:02,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:21:02,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:21:02,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:21:02,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:21:02,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:21:02,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:21:02,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:21:02" (1/1) ... [2024-11-13 22:21:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:21:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:21:02,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:21:02,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:21:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:21:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:21:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:21:02,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:21:03,012 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:21:03,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:21:04,380 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 22:21:04,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:21:04,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:21:04,752 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:21:04,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:21:04 BoogieIcfgContainer [2024-11-13 22:21:04,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:21:04,753 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:21:04,754 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:21:04,768 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:21:04,768 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:21:04" (1/1) ... [2024-11-13 22:21:04,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:21:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 22:21:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 22:21:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:21:04,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-13 22:21:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-13 22:21:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:21:06,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-13 22:21:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-13 22:21:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:21:08,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-13 22:21:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-13 22:21:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 22:21:09,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-13 22:21:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-13 22:21:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 22:21:10,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-13 22:21:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-13 22:21:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:21:11,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-13 22:21:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-13 22:21:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 22:21:11,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:21:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-13 22:21:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-13 22:21:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:21:13,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:21:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-13 22:21:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-13 22:21:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:21:14,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-13 22:21:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-13 22:21:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 22:21:15,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-13 22:21:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-13 22:21:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 22:21:17,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:21:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-13 22:21:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-13 22:21:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:21:17,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-13 22:21:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-13 22:21:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:21:20,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-13 22:21:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-13 22:21:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:21:20,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-11-13 22:21:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-11-13 22:21:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:21:21,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:21:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-11-13 22:21:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-13 22:21:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:21:21,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-11-13 22:21:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-11-13 22:21:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:21:23,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-11-13 22:21:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-11-13 22:21:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:21:25,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:25,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-11-13 22:21:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-11-13 22:21:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:21:26,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 22:21:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-13 22:21:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-13 22:21:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 22:21:26,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-11-13 22:21:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-11-13 22:21:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 22:21:27,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 22:21:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-11-13 22:21:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-11-13 22:21:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:21:28,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-11-13 22:21:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-11-13 22:21:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:21:28,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 718 states and 867 transitions. [2024-11-13 22:21:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 867 transitions. [2024-11-13 22:21:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:21:30,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-11-13 22:21:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-11-13 22:21:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 22:21:31,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-11-13 22:21:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-11-13 22:21:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:21:34,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 867 states and 1048 transitions. [2024-11-13 22:21:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1048 transitions. [2024-11-13 22:21:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:21:36,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-11-13 22:21:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-11-13 22:21:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:21:37,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-11-13 22:21:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-11-13 22:21:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:21:39,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-11-13 22:21:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-11-13 22:21:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:21:40,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-11-13 22:21:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-11-13 22:21:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:21:43,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-11-13 22:21:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-11-13 22:21:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:21:44,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:21:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1064 states and 1280 transitions. [2024-11-13 22:21:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1280 transitions. [2024-11-13 22:21:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:21:47,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 22:21:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1079 states and 1299 transitions. [2024-11-13 22:21:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1299 transitions. [2024-11-13 22:21:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 22:21:48,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1171 states and 1395 transitions. [2024-11-13 22:21:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1395 transitions. [2024-11-13 22:21:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:21:50,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1217 states and 1449 transitions. [2024-11-13 22:21:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1449 transitions. [2024-11-13 22:21:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:21:52,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1218 states and 1450 transitions. [2024-11-13 22:21:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1450 transitions. [2024-11-13 22:21:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:21:53,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:21:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1278 states and 1523 transitions. [2024-11-13 22:21:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1523 transitions. [2024-11-13 22:21:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 22:21:55,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:55,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:21:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1316 states and 1567 transitions. [2024-11-13 22:21:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1567 transitions. [2024-11-13 22:21:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:21:56,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:21:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1352 states and 1606 transitions. [2024-11-13 22:21:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2024-11-13 22:21:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:21:57,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:22:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1404 states and 1667 transitions. [2024-11-13 22:22:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1667 transitions. [2024-11-13 22:22:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:22:01,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:22:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1407 states and 1670 transitions. [2024-11-13 22:22:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1670 transitions. [2024-11-13 22:22:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:22:02,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:22:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1409 states and 1674 transitions. [2024-11-13 22:22:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1674 transitions. [2024-11-13 22:22:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:22:02,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:22:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1448 states and 1719 transitions. [2024-11-13 22:22:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1719 transitions. [2024-11-13 22:22:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:22:05,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:22:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1464 states and 1735 transitions. [2024-11-13 22:22:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1735 transitions. [2024-11-13 22:22:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:22:07,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:22:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1511 states and 1797 transitions. [2024-11-13 22:22:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1797 transitions. [2024-11-13 22:22:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:22:10,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:22:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1520 states and 1805 transitions. [2024-11-13 22:22:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1805 transitions. [2024-11-13 22:22:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:22:11,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:22:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1537 states and 1826 transitions. [2024-11-13 22:22:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1826 transitions. [2024-11-13 22:22:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:22:12,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:22:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1540 states and 1829 transitions. [2024-11-13 22:22:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1829 transitions. [2024-11-13 22:22:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 22:22:13,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:22:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1674 states and 1978 transitions. [2024-11-13 22:22:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1978 transitions. [2024-11-13 22:22:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:22:18,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 22:22:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 1712 states and 2018 transitions. [2024-11-13 22:22:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2018 transitions. [2024-11-13 22:22:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:22:19,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:22:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1725 states and 2033 transitions. [2024-11-13 22:22:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2033 transitions. [2024-11-13 22:22:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:22:20,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:22:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1728 states and 2037 transitions. [2024-11-13 22:22:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2037 transitions. [2024-11-13 22:22:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 22:22:21,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:22:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1816 states and 2139 transitions. [2024-11-13 22:22:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2139 transitions. [2024-11-13 22:22:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 22:22:24,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:22:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1890 states and 2215 transitions. [2024-11-13 22:22:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2215 transitions. [2024-11-13 22:22:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 22:22:27,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:22:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1911 states and 2237 transitions. [2024-11-13 22:22:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2237 transitions. [2024-11-13 22:22:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 22:22:29,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 22:22:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 1913 states and 2239 transitions. [2024-11-13 22:22:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2239 transitions. [2024-11-13 22:22:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:22:30,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 22:22:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1928 states and 2256 transitions. [2024-11-13 22:22:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2256 transitions. [2024-11-13 22:22:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 22:22:31,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 22:22:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1965 states and 2301 transitions. [2024-11-13 22:22:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2301 transitions. [2024-11-13 22:22:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:22:33,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:22:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1976 states and 2313 transitions. [2024-11-13 22:22:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2313 transitions. [2024-11-13 22:22:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 22:22:34,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:22:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1979 states and 2317 transitions. [2024-11-13 22:22:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2317 transitions. [2024-11-13 22:22:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 22:22:35,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:22:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 1982 states and 2320 transitions. [2024-11-13 22:22:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2320 transitions. [2024-11-13 22:22:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:22:35,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:22:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1996 states and 2336 transitions. [2024-11-13 22:22:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2336 transitions. [2024-11-13 22:22:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:22:36,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 22:22:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2037 states and 2384 transitions. [2024-11-13 22:22:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2384 transitions. [2024-11-13 22:22:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 22:22:38,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:22:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2076 states and 2438 transitions. [2024-11-13 22:22:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2438 transitions. [2024-11-13 22:22:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:22:42,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 22:22:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2090 states and 2453 transitions. [2024-11-13 22:22:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2453 transitions. [2024-11-13 22:22:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:22:43,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 22:22:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2093 states and 2456 transitions. [2024-11-13 22:22:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2456 transitions. [2024-11-13 22:22:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:22:44,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 22:22:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2105 states and 2469 transitions. [2024-11-13 22:22:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2469 transitions. [2024-11-13 22:22:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:22:46,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 22:22:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2107 states and 2474 transitions. [2024-11-13 22:22:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2474 transitions. [2024-11-13 22:22:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:22:46,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 22:22:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2119 states and 2486 transitions. [2024-11-13 22:22:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2486 transitions. [2024-11-13 22:22:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:22:47,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:22:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2196 states and 2580 transitions. [2024-11-13 22:22:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2580 transitions. [2024-11-13 22:22:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:22:55,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:22:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2198 states and 2581 transitions. [2024-11-13 22:22:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2581 transitions. [2024-11-13 22:22:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:22:56,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:22:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2201 states and 2584 transitions. [2024-11-13 22:22:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2584 transitions. [2024-11-13 22:22:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:22:56,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:22:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2210 states and 2593 transitions. [2024-11-13 22:22:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2593 transitions. [2024-11-13 22:22:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:22:57,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 22:22:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:22:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2234 states and 2619 transitions. [2024-11-13 22:22:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2619 transitions. [2024-11-13 22:22:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:22:58,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:22:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:22:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:22:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:23:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2311 states and 2716 transitions. [2024-11-13 22:23:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2716 transitions. [2024-11-13 22:23:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:23:03,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:23:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2315 states and 2720 transitions. [2024-11-13 22:23:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2720 transitions. [2024-11-13 22:23:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:23:05,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-13 22:23:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2318 states and 2723 transitions. [2024-11-13 22:23:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2723 transitions. [2024-11-13 22:23:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:23:05,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-13 22:23:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2321 states and 2726 transitions. [2024-11-13 22:23:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2726 transitions. [2024-11-13 22:23:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 22:23:05,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 22:23:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2324 states and 2729 transitions. [2024-11-13 22:23:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2729 transitions. [2024-11-13 22:23:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:06,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:23:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2335 states and 2742 transitions. [2024-11-13 22:23:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2742 transitions. [2024-11-13 22:23:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:08,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:23:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2397 states and 2809 transitions. [2024-11-13 22:23:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2809 transitions. [2024-11-13 22:23:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:16,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:23:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2446 states and 2862 transitions. [2024-11-13 22:23:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2862 transitions. [2024-11-13 22:23:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:23,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:23:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2459 states and 2875 transitions. [2024-11-13 22:23:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 2875 transitions. [2024-11-13 22:23:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:25,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 22:23:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2462 states and 2882 transitions. [2024-11-13 22:23:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2882 transitions. [2024-11-13 22:23:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:26,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 22:23:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2463 states and 2882 transitions. [2024-11-13 22:23:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 2882 transitions. [2024-11-13 22:23:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:23:27,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 22:23:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2464 states and 2883 transitions. [2024-11-13 22:23:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2883 transitions. [2024-11-13 22:23:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 22:23:28,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:28,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:23:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2471 states and 2890 transitions. [2024-11-13 22:23:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2890 transitions. [2024-11-13 22:23:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 22:23:28,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:23:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2472 states and 2890 transitions. [2024-11-13 22:23:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2890 transitions. [2024-11-13 22:23:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 22:23:29,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 22:23:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2503 states and 2923 transitions. [2024-11-13 22:23:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2923 transitions. [2024-11-13 22:23:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:23:33,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:23:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2506 states and 2927 transitions. [2024-11-13 22:23:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2927 transitions. [2024-11-13 22:23:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:23:34,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 22:23:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2518 states and 2942 transitions. [2024-11-13 22:23:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2942 transitions. [2024-11-13 22:23:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:23:36,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:36,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 22:23:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 2643 states and 3089 transitions. [2024-11-13 22:23:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3089 transitions. [2024-11-13 22:23:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:23:44,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:23:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 2704 states and 3158 transitions. [2024-11-13 22:23:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3158 transitions. [2024-11-13 22:23:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:23:47,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:23:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 2709 states and 3164 transitions. [2024-11-13 22:23:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3164 transitions. [2024-11-13 22:23:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 22:23:48,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 22:23:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 2710 states and 3164 transitions. [2024-11-13 22:23:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3164 transitions. [2024-11-13 22:23:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 22:23:48,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:23:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:23:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 22:23:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 2762 states and 3212 transitions. [2024-11-13 22:23:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3212 transitions. [2024-11-13 22:23:52,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:23:52,897 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 97 iterations. [2024-11-13 22:23:52,909 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 22:24:29,257 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,257 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,258 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,258 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,258 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,258 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,258 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,259 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,259 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,259 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,259 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,260 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,260 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,260 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,261 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,261 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,261 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,261 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,262 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,262 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,262 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,263 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,263 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,263 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,263 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,264 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,264 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,264 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,265 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,265 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,265 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,266 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,266 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,266 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,266 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,267 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,267 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,267 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,267 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,268 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,268 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,268 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,268 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,268 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,269 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,269 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,269 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:24:29,269 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,269 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L557-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 22:24:29,270 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,271 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,272 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,272 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,272 INFO L77 FloydHoareUtils]: At program point L560-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 22:24:29,273 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,273 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,273 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-13 22:24:29,273 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 561) no Hoare annotation was computed. [2024-11-13 22:24:29,273 INFO L75 FloydHoareUtils]: For program point L561(line 561) no Hoare annotation was computed. [2024-11-13 22:24:29,274 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,274 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,274 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,274 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,275 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,275 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 22:24:29,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:24:29 ImpRootNode [2024-11-13 22:24:29,291 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:24:29,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:24:29,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:24:29,292 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:24:29,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:21:04" (3/4) ... [2024-11-13 22:24:29,297 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:24:29,319 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 22:24:29,320 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 22:24:29,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 22:24:29,326 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:24:29,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:24:29,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:24:29,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:24:29,482 INFO L158 Benchmark]: Toolchain (without parser) took 207340.65ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 91.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 687.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,482 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:24:29,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.91ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 64.2MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.12ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 58.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,484 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:24:29,485 INFO L158 Benchmark]: RCFGBuilder took 1909.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.9MB in the beginning and 256.1MB in the end (delta: -201.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,486 INFO L158 Benchmark]: CodeCheck took 204537.41ms. Allocated memory was 352.3MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 256.1MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 610.9MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,487 INFO L158 Benchmark]: Witness Printer took 189.97ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:29,489 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 168.1s, OverallIterations: 97, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295379 SdHoareTripleChecker+Valid, 870.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294522 mSDsluCounter, 40027 SdHoareTripleChecker+Invalid, 750.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33977 mSDsCounter, 63446 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638579 IncrementalHoareTripleChecker+Invalid, 702025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63446 mSolverCounterUnsat, 6050 mSDtfsCounter, 638579 mSolverCounterSat, 7.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131267 GetRequests, 123432 SyntacticMatches, 6909 SemanticMatches, 926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611250 ImplicationChecksByTransitivity, 112.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 19479 NumberOfCodeBlocks, 19479 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 19383 ConstructedInterpolants, 0 QuantifiedInterpolants, 151266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 26 PerfectInterpolantSequences, 17695/22783 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 561]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.91ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 64.2MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.12ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 58.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1909.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.9MB in the beginning and 256.1MB in the end (delta: -201.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * CodeCheck took 204537.41ms. Allocated memory was 352.3MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 256.1MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 610.9MB. Max. memory is 16.1GB. * Witness Printer took 189.97ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 22:24:29,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0765ceac-406d-4c29-aab9-4d20e695772a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE